STES: A Stream Cipher Based Low Cost Scheme for Securing Stored Data, by Debrup Chakraborty and Cuauhtemoc Mancillas-Lopez and Palash Sarkar
The problem of securing data present on USB memories and SD cards has not been adequately addressed in the cryptography literature. While the formal notion of a tweakable enciphering scheme (TES) is well accepted as the proper primitive for secure data storage, the real challenge is to design a low cost TES which can perform at the data rates of the targeted memory devices. In this work, we provide the first answer to this problem. Our solution, called STES, combines a stream cipher with a XOR universal hash function. The security
of STES is rigorously analyzed in the usual manner of provable security approach. By carefully defining appropriate variants of the multi-linear hash function and the pseudo-dot product based
hash function we obtain controllable trade-offs between area and throughput. We combine the hash function with the recent hardware oriented stream ciphers, namely Mickey, Grain and Trivium. Our implementations are targeted towards two low cost FPGAs -- Xilinx Spartan~3 and Lattice ICE40. Simulation results demonstrate
that the speed of encryption/decryption matches the data rates of different USB and SD memories. We believe that our work opens up the possibility of actually putting FPGAs within controllers of such memories to perform low-level in-place encryption.
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based, by Craig Gentry and Amit Sahai and Brent Waters
We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem. In previous LWE-based FHE schemes, multiplication is a complicated and expensive step involving \"relinearization\". In this work, we propose a new technique for building FHE schemes that we call the \"approximate eigenvector\" method. In our scheme, for the most part, homomorphic addition and multiplication are just matrix addition and multiplication. This makes our scheme both asymptotically faster and (we believe) easier to understand.
In previous schemes, the homomorphic evaluator needs to obtain the user\'s \"evaluation key\", which consists of a chain of encrypted secret keys. Our scheme has no evaluation key. The evaluator can do homomorphic operations without knowing the user\'s public key at all, except for some basic parameters. This fact helps us construct the first identity-based FHE scheme. Using similar techniques, we show how to compile a recent attribute-based encryption scheme for circuits by Gorbunov et al. into an attribute-based FHE scheme that permits data encrypted under the same index to be processed homomorphically.
Report on SAC 2012
The Conference on the Selected Areas in Cryptography in 2012 (SAC 2012) was held at University of Windsor, Windsor, Canada on August 15-16, 2012.
SAC 2012 received 87 submissions. Each submission was reviewed by at least three reviewers. 24 papers were selected for publication in the proceedings and acceptance rate was 24/87=27.6%. Two invited talks were given by Vincent Rijmen (KU Leuven) and Ian Goldberg (University of Waterloo) on the topics "Extracts from the SHA-3 competition" and "Privacy Enhancing Technologies for the Internet", respectively.
A digital version of the pre-proceedings was provided to the 55 attendees. Revised versions of the accepted papers were published in the LNCS 7707 by Springer. Most presentation slides for the technical sessions including the invited talks can be found on the conference website at http://www.uwindsor.ca/sac2012/.
The program co-chairs were Lars R. Knudsen and Huapeng Wu, who wish to thank the sponsors of SAC 2012, including the Vice President (Research) Office, Faculty of Engineering, and the Department of Electrical and Computer Engineering, University of Windsor for their enthusiastic and generous support.
Report on Crypto 2012
Crypto 2012 was held August 19-23 on the beautiful campus of the University
of California, Santa Barbara. The Program Co-chairs were Rei Safavi-Naini
and Ran Canetti, and the General Chair was Yiqun Lisa Yin.
A total of 225 papers were submitted, and 48 were accepted for publication,
a record number for IACR flagship conferences. For the Best Paper Award,
the PC overwhelmingly selected “Efficient Dissection of Composite Problems,
with Applications to Cryptanalysis, Knapsacks and Combinatorial Search
Problems” by Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir.
There were two invited talks and one tutorial session at the conference.
Professor Jonathan Zittrain from Harvard gave a talk entitled “The End of
Crypto”. Dr. Ernie Brickell from Intel spoke about “Recent Advances and
Existing Research Questions in Platform Security”. Professor Adam Smith
from Penn State delivered a tutorial on “Pinning Down ‘Privacy’ in
Statistical Databases”. Dan Bernstein and Tanja Lange co-chaired yet
another entertaining Rump Session. Almost all of the talks were video
recorded. These videos, along with author's slides and full versions of the
papers, are available on the conference program webpage.
Generous donations were given by five industry sponsors Google, Microsoft
Research, Qualcomm, RIM, and Voltage Security, as well as the Marconi Fund.
In addition, the conference applied and received a special funding of
$10,000 from the National Science Foundation (NSF). With all the financial
support, stipends were offered to over 40 students, both domestic and
The Chairs of Crypto 2012 were very grateful for the wonderful work of
Sally Vito and the UCSB conference services staff.
Report on Inscrypt 2012
Inscrypt 2012, Nov. 28-30, 2012 in Beijing, China
The 8th China International Conference on Information Security and Cryptology
was held at Beijing International Convention Center, Nov. 28 - Nov. 30, 2012, Beijing, China. See http://www.inscrypt.cn/2012/ for the web-site.
The program co-chairs were Miroslaw Kutylowski and Moti Yung, and the general chair was Dongdai Lin. Inscrypt 2012 received 73 submissions from 24 countries, and 23 were selected for presentation at the conference. These accepted papers, after revision, appeared in the conference post-proceeding which was published as Lecture Notes in Computer Science vol. 7763.
Two invited talks were given by Jung Hee Cheon (Seoul National University) and Goichiro Hanaoka (AIST) on the topics "Open Questions for the Discrete Logarithm" and "Toward Shorter Ciphertext in ElGamal-type CCA-secure Public Key Encryption", respectively. Additionally, the conference was featured with two tutorials given by Junfeng Fan (KU Leuven) and Miroslaw Kutylowski (Wroclaw University of Technology) on the topics "Cryptographic hardware: design for low power, low area and security against physical attacks" and "Electronic Personal Identity Documents", respectively.
The conference banquet was a traditional Chinese one, with Chinese rice wine (Baijiu) served. The registration fee was 450 USD for regular and 350 USD for full-time student. About 90 attendees enjoyed the 3-day conference sessions and Beijing in winter.
Report on TCC 2012
The 9th IACR Theory of Cryptography Conference (TCC'12) was held at the Hotel "Villa Diodoro" in Taormina, Italy, on March 19-21, 2012. The organizing committee included Rosario Gennaro and Nelly Fazio (General Co-chairs) and Dario Catalano (Local Arrangements Chair).
The technical program featured 36 papers selected from 131 submissions, along with two invited lectures: "Locally Decodable Codes" by Sergey Yekhanin of Microsoft Research and "Non-Interactive Zero-Knowledge" by Jens Groth of the University College of London. The program was assembled by a 20-member Program Committee led by Ronald Cramer as Program Chair.
The conference attracted 108 delegates, including 29 students of which 16 were given financial aid to attend the conference in the form of free registration and free housing.
The generous financial support of the conference sponsors (Bell Labs, IBM Research, Microsoft, AT&T and Oxford University Press) was also an important factor for the success of the event, and is gratefully acknowledged.
This was the first IACR workshop or conference where printed proceedings were optional, and had to be ordered at the time of registration for an extra fee of $50. Conference delegates received an electronic copy of the proceedings stored on a USB stick which was donated by DEShaw.
Research fellow in computer security, University of Bergen, Norway, EEA
The Department of Informatics has a vacancy for 2 research fellows (PhD positions) in computer security for a period of 4 years. The recruited students will work in a new research group, named Simula@UiB, that is headed by Professor Kjell Jørgen Hole. The group is a joint venture between Simula Research Laboratory (http://simula.no) and University of Bergen. It currently consists of two professors, two research scientists, one PhD student and several master students.
Candidates must have good analytical skills and be able to generate their own research ideas. They must have good communication skills and be fluent in English. Experience in computer security is an advantage. Candidates with experience from one or more of the areas Cyber Security, Software Security, Network Science, Game Theory, or Information Theory are of special interest.
In total, the fellowship period is 4 years. For positions with a 4-year duration 25 pct of the period will be designated to teaching and/or administrative duties. The fellowship period may be reduced if the successful applicant has held previous employment as research fellow or similar.