Cryptology ePrint Archive

Cryptology ePrint Archive http://eprint.iacr.org/ Recently modified papers in the IACR Cryptology ePrint Archive en-us Thu, 09 Feb 2012 18:11:02 -0700 webmaster@iacr.org eprint-editor@iacr.org None of your business 60 http://eprint.iacr.org/2012/056 <![CDATA[A New Pseudorandom Generator from Collision-Resistant Hash Functions]]>, by Alexandra Boldyreva and Virendra Kumar http://eprint.iacr.org/2012/056 http://eprint.iacr.org/2012/055 <![CDATA[Cryptanalysis of Mun et al.'s anonymous authentication scheme for roaming service in global mobility networks]]>, by Hongbin Tang and Xinsong Liu http://eprint.iacr.org/2012/055 http://eprint.iacr.org/2012/054 <![CDATA[On the performance of certain Private Set Intersection protocols. (And some remarks on the recent paper by Huang et al. in NDSS'12)]]>, by Emiliano De Cristofaro and Gene Tsudik http://eprint.iacr.org/2012/054 http://eprint.iacr.org/2012/053 <![CDATA[Beating Shannon requires BOTH efficient adversaries AND non-zero advantage]]>, by Yevgeniy Dodis http://eprint.iacr.org/2012/053 http://eprint.iacr.org/2012/052 <![CDATA[Identity-based Encryption with Efficient Revocation]]>, by Alexandra Boldyreva and Vipul Goyal and Virendra Kumar http://eprint.iacr.org/2012/052 http://eprint.iacr.org/2012/051 <![CDATA[Eavesdropping on Satellite Telecommunication Systems]]>, by Benedikt Driessen http://eprint.iacr.org/2012/051 http://eprint.iacr.org/2012/050 <![CDATA[Investigating the Potential of Custom Instruction Set Extensions for SHA-3 Candidates on a 16-bit Microcontroller Architecture]]>, by Jeremy Constantin and Andreas Burg and Frank K. Gurkaynak http://eprint.iacr.org/2012/050 http://eprint.iacr.org/2012/049 <![CDATA[2-Dimension Sums: Distinguishers Beyond Three Rounds of RIPEMD-128 and RIPEMD-160]]>, by Yu Sasaki and Lei Wang http://eprint.iacr.org/2012/049 http://eprint.iacr.org/2012/048 <![CDATA[Designing Integrated Accelerator for Stream Ciphers with Structural Similarities]]>, by Sourav Sen Gupta and Anupam Chattopadhyay and Ayesha Khalid http://eprint.iacr.org/2012/048 http://eprint.iacr.org/2012/047 <![CDATA[Incremental Deterministic Public-Key Encryption]]>, by Ilya Mironov and Omkant Pandey and Omer Reingold and Gil Segev http://eprint.iacr.org/2012/047 http://eprint.iacr.org/2012/046 <![CDATA[Modifying Boolean Functions to Ensure Maximum Algebraic Immunity]]>, by Konstantinos Limniotis and Nicholas Kolokotronis and Nicholas Kalouptsidis http://eprint.iacr.org/2012/046 http://eprint.iacr.org/2012/045 <![CDATA[Signature Schemes Secure against Hard-to-Invert Leakage]]>, by Sebastian Faust and Carmit Hazay and Jesper Buus Nielsen and Peter Sebastian Nordholt and Angela Zottarel http://eprint.iacr.org/2012/045 http://eprint.iacr.org/2012/044 <![CDATA[PSCPA: Patient Self-controllable Privacy-preserving Cooperative Authentication in Distributed m-Healthcare Systems]]>, by Jun Zhou, Zhenfu Cao http://eprint.iacr.org/2012/044 http://eprint.iacr.org/2012/043 <![CDATA[A novel Group Key Transfer Protocol]]>, by Chingfang Hsu and Bing Zeng and Qi Cheng and Guohua Cui http://eprint.iacr.org/2012/043 http://eprint.iacr.org/2012/042 <![CDATA[Key Length Estimation of Pairing-based Cryptosystems using $\eta_T$ Pairing]]>, by Naoyuki Shinohara and Takeshi Shimoyama and Takuya Hayashi and Tsuyoshi Takagi http://eprint.iacr.org/2012/042 http://eprint.iacr.org/2012/041 <![CDATA[STITCH-256: A NEW DEDICATED CRYPTOGRAPHIC HASH FUNCTION]]>, by Norziana Jamil and Ramlan Mahmood and Muhammad Reza Z'aba and Nur Izura Udzir and Zuriati Ahmad Zukarnaen http://eprint.iacr.org/2012/041 http://eprint.iacr.org/2012/040 <![CDATA[Single-block collision attack on MD5]]>, by Marc Stevens http://eprint.iacr.org/2012/040 http://eprint.iacr.org/2012/039 <![CDATA[Security Analysis of a Multi-Factor Authenticated Key Exchange Protocol]]>, by Feng Hao and Dylan Clarke http://eprint.iacr.org/2012/039 http://eprint.iacr.org/2012/038 <![CDATA[Cryptanalysis of the CHES 2009/2010 Random Delay Countermeasure]]>, by François Durvaux and Mathieu Renauld and François-Xavier Standaert and Loic van Oldeneel tot Oldenzeel and Nicolas Veyrat-Charvillon http://eprint.iacr.org/2012/038 http://eprint.iacr.org/2012/037 <![CDATA[Recent Results on Generalized q-ary Bent Functions]]>, by Deep Singh, Maheshanand Bhaintwal and Brajesh Kumar Singh http://eprint.iacr.org/2012/037 http://eprint.iacr.org/2012/036 <![CDATA[Efficient Leakage-free Authentication of Trees, Graphs and Forests]]>, by Ashish Kundu, Mikhail Atallah, Elisa Bertino http://eprint.iacr.org/2012/036 http://eprint.iacr.org/2012/035 <![CDATA[Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations]]>, by Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Francois-Xavier Standaert, John Steinberger, Elmar Tischhauser 2$, which is left as an open and interesting problem. Additionally, in terms of statistical attacks, we show that the distribution of Fourier coefficients for the cipher over all keys is close to ideal. Lastly, we define a practical instance of the construction with $t=2$ using AES referred to as AES$^2$. Any attack on AES$^2$ with complexity below $2^{85}$ will have to make use of AES with a fixed known key in a non-black box manner. However, we conjecture its security is $2^{128}$. ]]> http://eprint.iacr.org/2012/035 http://eprint.iacr.org/2012/034 <![CDATA[Automatic Quantification of Cache Side-Channels]]>, by Boris Köpf and Laurent Mauborgne and Martin Ochoa http://eprint.iacr.org/2012/034 http://eprint.iacr.org/2012/033 <![CDATA[A note on hyper-bent functions via Dillon-like exponents]]>, by Sihem Mesnager and Jean-Pierre Flori http://eprint.iacr.org/2012/033 http://eprint.iacr.org/2012/032 <![CDATA[Counterexamples to Hardness Amplification Beyond Negligible]]>, by Yevgeniy Dodis and Abhishek Jain and Tal Moran and Daniel Wichs \frac{1}{2}$, then the direct product provably amplifies hardness to some negligible probability. Naturally, we would expect that we can amplify hardness exponentially, all the way to $2^{-n}$ probability, or at least to some fixed/known negligible such as $n^{-\log n}$ in the security parameter $n$, just by taking sufficiently many instances of the weak primitive. Although it is known that such parameters cannot be proven via black-box reductions, they may seem like reasonable conjectures, and, to the best of our knowledge, are widely believed to hold. In fact, a conjecture along these lines was introduced in a survey of Goldreich, Nisan and Wigderson (ECCC '95). In this work, we show that such conjectures are false by providing simple but surprising counterexamples. In particular, we construct weakly secure signatures and one-way functions, for which standard hardness amplification results are known to hold, but for which hardness does not amplify beyond just negligible. That is, for any negligible function $\eps(n)$, we instantiate these primitives so that the direct product can always be broken with probability $\eps(n)$, no matter how many copies we take. ]]> http://eprint.iacr.org/2012/032 http://eprint.iacr.org/2012/031 <![CDATA[An error in "On a new formal proof model for RFID location privacy"]]>, by Da-Zhi Sun http://eprint.iacr.org/2012/031 http://eprint.iacr.org/2012/030 <![CDATA[Fault Analysis of the KATAN Family of Block Ciphers]]>, by Shekh Faisal Abdul-Latip and Mohammad Reza Reyhanitabar and Willy Susilo and Jennifer Seberry http://eprint.iacr.org/2012/030 http://eprint.iacr.org/2012/029 <![CDATA[On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model]]>, by Yannick Seurin http://eprint.iacr.org/2012/029 http://eprint.iacr.org/2012/027 <![CDATA[Breaking the provably secure SAKE-C authenticated key exchange protocol with Extended Key Compromise Impersonation (E-KCI) Attack ]]>, by Ali Mackvandi and Maryam Saeed and Mansour Naddafiun http://eprint.iacr.org/2012/027 http://eprint.iacr.org/2012/022 <![CDATA[Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity]]>, by Mihir Bellare and Stefano Tessaro Information-theoretic security, entropy, extractors http://eprint.iacr.org/2012/022 http://eprint.iacr.org/2012/017 <![CDATA[Secondary constructions on generalized bent functions]]>, by Brajesh Kumar Singh http://eprint.iacr.org/2012/017 http://eprint.iacr.org/2012/016 <![CDATA[Efficient Mix-Net Verication by Proofs of Random Blocks]]>, by Denise Demirel and Melanie Volkamer and Hugo Jonker http://eprint.iacr.org/2012/016 http://eprint.iacr.org/2012/015 <![CDATA[A Cryptographic Treatment of the Wiretap Channel]]>, by Mihir Bellare and Stefano Tessaro and Alexander Vardy Information-theoretic security, entropy, keyless http://eprint.iacr.org/2012/015 http://eprint.iacr.org/2012/014 <![CDATA[On the Indifferentiable Hash Functions in the Multi-Stage Security Games]]>, by Yusuke Naito http://eprint.iacr.org/2012/014 http://eprint.iacr.org/2011/706 <![CDATA[Improved Side Channel Attacks on Pairing Based Cryptography]]>, by Johannes Blömer and Peter Günther and Gennadij Liske http://eprint.iacr.org/2011/706 http://eprint.iacr.org/2011/703 <![CDATA[Waters Signatures with Optimal Security Reduction]]>, by Dennis Hofheinz and Tibor Jager http://eprint.iacr.org/2011/703 http://eprint.iacr.org/2011/664 <![CDATA[On the Security of ID Based Signcryption Schemes]]>, by S. Sharmila Deva Selvi and S. Sree Vivek and Dhinakaran Vinayagamurthy and C. Pandu Rangan http://eprint.iacr.org/2011/664 http://eprint.iacr.org/2011/659 <![CDATA[Formally Assessing Cryptographic Entropy]]>, by Daniel R. L. Brown http://eprint.iacr.org/2011/659 http://eprint.iacr.org/2011/648 <![CDATA[Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption]]>, by Tatsuaki Okamoto and Katsuyuki Takashima http://eprint.iacr.org/2011/648 http://eprint.iacr.org/2011/594 <![CDATA[Receipt Freeness of Prêt à Voter Provably Secure]]>, by Dalia Khader and Peter Y.A. Ryan http://eprint.iacr.org/2011/594 http://eprint.iacr.org/2011/543 <![CDATA[Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption]]>, by Tatsuaki Okamoto and Katsuyuki Takashima http://eprint.iacr.org/2011/543 http://eprint.iacr.org/2011/398 <![CDATA[Random Self-Reducibility Properties of Learning Problems over Burnside Groups of Exponent 3]]>, by Nelly Fazio and Kevin Iga and Antonio Nicolosi and Ludovic Perret and William E. Skeith III http://eprint.iacr.org/2011/398 http://eprint.iacr.org/2011/336 <![CDATA[Cryptanalysis of an Authenticated Key Agreement Protocol for Wireless Mobile Communications]]>, by Debiao He http://eprint.iacr.org/2011/336 http://eprint.iacr.org/2011/286 <![CDATA[Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family]]>, by Dmitry Khovratovich and Christian Rechberger and Alexandra Savelieva http://eprint.iacr.org/2011/286 http://eprint.iacr.org/2011/280 <![CDATA[DDH-like Assumptions Based on Extension Rings]]>, by Ronald Cramer and Ivan Damgaard and Eike Kiltz and Sarah Zakarias and Angela Zottarel http://eprint.iacr.org/2011/280 http://eprint.iacr.org/2011/202 <![CDATA[Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes]]>, by Markku-Juhani O. Saarinen http://eprint.iacr.org/2011/202 http://eprint.iacr.org/2011/020 <![CDATA[Cover and Decomposition Index Calculus on Elliptic Curves made practical. Application to a seemingly secure curve over $\F_{p^6}$]]>, by Antoine Joux and Vanessa Vitse http://eprint.iacr.org/2011/020 http://eprint.iacr.org/2010/624 <![CDATA[No-leak authentication by the Sherlock Holmes method]]>, by Dima Grigoriev and Vladimir Shpilrain http://eprint.iacr.org/2010/624 http://eprint.iacr.org/2009/621 <![CDATA[On the Analysis of Cryptographic Assumptions in the Generic Ring Model]]>, by Tibor Jager and Jörg Schwenk http://eprint.iacr.org/2009/621 http://eprint.iacr.org/2009/310 <![CDATA[RFID distance bounding protocol with mixed challenges to prevent relay attacks]]>, by Chong Hee Kim and Gildas Avoine http://eprint.iacr.org/2009/310 http://eprint.iacr.org/2007/234 <![CDATA[Provable-Security Analysis of Authenticated Encryption in Kerberos]]>, by Alexandra Boldyreva and Virendra Kumar http://eprint.iacr.org/2007/234