Cryptology ePrint Archive

Cryptology ePrint Archive http://eprint.iacr.org/ Recently modified papers in the IACR Cryptology ePrint Archive en-us Fri, 03 Jul 2009 20:41:02 -0600 webmaster@iacr.org eprint-editor@iacr.org None of your business 60 http://eprint.iacr.org/2009/323 <![CDATA[Factoring Unbalanced Moduli with Known Bits]]>, by Eric Brier and David Naccache and Mehdi Tibouchi q^3$ be an RSA modulus. This note describes a LLL-based method allowing to factor $n$ given $2log_2q$ contiguous bits of $p$, irrespective to their position. A second method is presented, which needs fewer bits but whose length depends on the position of the known bit pattern. Finally, we introduce a somewhat surprising ad hoc method where two different known bit chunks, totalling $\frac32 log_2 q$ bits suffice to factor $n$. ]]> http://eprint.iacr.org/2009/323 http://eprint.iacr.org/2009/322 <![CDATA[Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS]]>, by Reynald Affeldt, David Nowak and Kiyoshi Yamada http://eprint.iacr.org/2009/322 http://eprint.iacr.org/2009/321 <![CDATA[Tweakable Enciphering Schemes From Stream Ciphers With IV]]>, by Palash Sarkar http://eprint.iacr.org/2009/321 http://eprint.iacr.org/2009/320 <![CDATA[Automorphic Signatures in Bilinear Groups]]>, by Georg Fuchsbauer http://eprint.iacr.org/2009/320 http://eprint.iacr.org/2009/319 <![CDATA[Comments and Improvements on Chameleon Hashing Without Key Exposure Based on Factoring]]>, by Xiaofeng Chen and Haibo Tian and Fangguo Zhang http://eprint.iacr.org/2009/319 http://eprint.iacr.org/2009/318 <![CDATA[The Fermat factorization method revisited]]>, by ERRA Robert and GRENIER Chirstophe 0$ is a RSA modulus with primes $p$ and $q$ supposed of equal length. This equation is a bivariate integer polynomial equation and we propose to solve it directly using Coppersmith's method for bivariate integer polynomials. As we use them as a black box, our proofs will be brief. We show a first result : we can factor $N$ in a polynomial time if $|p-q| http://eprint.iacr.org/2009/318 http://eprint.iacr.org/2009/317 <![CDATA[Related-key Cryptanalysis of the Full AES-192 and AES-256]]>, by Alex Biryukov and Dmitry Khovratovich http://eprint.iacr.org/2009/317 http://eprint.iacr.org/2009/316 <![CDATA[An Efficient Password Security of Three-Party Key exchange Protocol based on ECDLP]]>, by Jayaprakash Kar, Dr.Bansidhar Majhi http://eprint.iacr.org/2009/316 http://eprint.iacr.org/2009/315 <![CDATA[Breaking RSA-based PIN Encryption with thirty ciphertext validity queries]]>, by N.P. Smart http://eprint.iacr.org/2009/315 http://eprint.iacr.org/2009/314 <![CDATA[Secure Two-Party Computation is Practical]]>, by B. Pinkas and T. Schneider and N.P. Smart and S. Williams http://eprint.iacr.org/2009/314 http://eprint.iacr.org/2009/313 <![CDATA[Identity Based Group Signatures from Hierarchical Identity-Based Encryption]]>, by Nigel P. Smart and Bogdan Warinschi http://eprint.iacr.org/2009/313 http://eprint.iacr.org/2009/312 <![CDATA[Jacobi Quartic Curves Revisited]]>, by Huseyin Hisil and Kenneth Koon-Ho Wong and Gary Carter and Ed Dawson http://eprint.iacr.org/2009/312 http://eprint.iacr.org/2009/311 <![CDATA[Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security]]>, by Sathya Narayanan G, Aishwarya T, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, Pandu Rangan C http://eprint.iacr.org/2009/311 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/2009/309 <![CDATA[Fault Attacks on RSA Signatures with Partially Unknown Messages]]>, by Jean-Sebastien Coron and Antoine Joux and Ilya Kizhvatov and David Naccache and Pascal Paillier http://eprint.iacr.org/2009/309 http://eprint.iacr.org/2009/308 <![CDATA[A note on the Certificateless Multi-receiver Signcryption Scheme]]>, by S. Sharmila Deva Selvi and S. Sree Vivek and C. Pandu Rangan http://eprint.iacr.org/2009/308 http://eprint.iacr.org/2009/307 <![CDATA[Anonymous Signatures Revisited]]>, by Vishal Saraswat and Aaram Yun http://eprint.iacr.org/2009/307 http://eprint.iacr.org/2009/306 <![CDATA[Authentic Time-Stamps for Archival Storage]]>, by Alina Oprea and Kevin D. Bowers http://eprint.iacr.org/2009/306 http://eprint.iacr.org/2009/305 <![CDATA[Improved generic algorithms for 3-collisions]]>, by Antoine Joux and Stefan Lucks http://eprint.iacr.org/2009/305 http://eprint.iacr.org/2009/304 <![CDATA[Factor-4 and 6 Compression of Cyclotomic Subgroups]]>, by Koray Karabina http://eprint.iacr.org/2009/304 http://eprint.iacr.org/2009/303 <![CDATA[Key extraction from general non-discrete signals]]>, by E. Verbitskiy and P. Tuyls and C. Obi and B. Schoenmakers and B. Skoric http://eprint.iacr.org/2009/303 http://eprint.iacr.org/2009/302 <![CDATA[Cryptanalysis of ESSENCE]]>, by Maria Naya-Plasencia and Andrea Röck and Jean-Philippe Aumasson and Yann Laigle-Chapuy and Gaëtan Leurent and Willi Meier and Thomas Peyrin http://eprint.iacr.org/2009/302 http://eprint.iacr.org/2009/301 <![CDATA[A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure]]>, by Yuyin Yu and Mingsheng Wang http://eprint.iacr.org/2009/301 http://eprint.iacr.org/2009/300 <![CDATA[Universally Composable Contributory Group Key Exchange]]>, by M. Choudary Gorantla and Colin Boyd and Juan Manuel Gonz\`alez Nieto http://eprint.iacr.org/2009/300 http://eprint.iacr.org/2009/299 <![CDATA[On the security of oscillator-based random number generators]]>, by Mathieu Baudet and David Lubicz and Julien Micolod and Andr\'e Tassiaux http://eprint.iacr.org/2009/299 http://eprint.iacr.org/2009/298 <![CDATA[On the Security of Certificateless Signcryption Schemes]]>, by S. Sharmila Deva Selvi, S. Sree Vivek. C. Pandu Ragan http://eprint.iacr.org/2009/298 http://eprint.iacr.org/2009/297 <![CDATA[A New Improved Distinguisher for HC-128]]>, by Subhabrata Sen and Rudradev Sengupta and Subhamoy Maitra and Goutam Paul and Shashwat Raizada http://eprint.iacr.org/2009/297 http://eprint.iacr.org/2009/296 <![CDATA[Perfectly Balanced Functions in Symbolic Dynamics]]>, by O.A. Logachev and A.A. Salnikov and S.V. Smyshlyaev and V.V. Yashchenko http://eprint.iacr.org/2009/296 http://eprint.iacr.org/2009/295 <![CDATA[Defending Against Key Abuse Attacks in KP-ABE Enabled Broadcast Systems]]>, by Shucheng Yu and Kui Ren and Wenjing Lou and Jin Li http://eprint.iacr.org/2009/295 http://eprint.iacr.org/2009/294 <![CDATA[Low Latency High Bandwidth Anonymous Overlay Network with Anonymous Routing]]>, by Roman Schlegel and Duncan S. Wong http://eprint.iacr.org/2009/294 http://eprint.iacr.org/2009/293 <![CDATA[Enhancing Attribute-based Encryption with Attribute Hierarchy]]>, by Jin Li and Qian Wang and Cong Wang and Kui Ren http://eprint.iacr.org/2009/293 http://eprint.iacr.org/2009/292 <![CDATA[Implementing Wagner's generalized birthday attack against the SHA-3 candidate FSB ]]>, by Daniel J. Bernstein and Tanja Lange and Christiane Peters and Ruben Niederhagen and Peter Schwabe http://eprint.iacr.org/2009/292 http://eprint.iacr.org/2009/291 <![CDATA[Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols]]>, by M. Choudary Gorantla and Colin Boyd and Juan Manuel Gonz\'alez Nieto http://eprint.iacr.org/2009/291 http://eprint.iacr.org/2009/290 <![CDATA[Security Analysis of Aggregate signature and Batch verification signature schemes]]>, by S.Sharmila Deva Selvi and S.Sree Vivek and J.Shriram and S.Kalaivani and C.Pandu Rangan http://eprint.iacr.org/2009/290 http://eprint.iacr.org/2009/289 <![CDATA[Analysis of the End-by-Hop Protocol for Secure Aggregation in Sensor Networks]]>, by Erik Zenner http://eprint.iacr.org/2009/289 http://eprint.iacr.org/2009/288 <![CDATA[Efficient Key Exchange with Tight Security Reduction]]>, by Jiang Wu and Berkant Ustaoglu http://eprint.iacr.org/2009/288 http://eprint.iacr.org/2009/287 <![CDATA[Generic Attacks on Alternating Unbalanced Feistel Schemes]]>, by Valerie Nachef http://eprint.iacr.org/2009/287 http://eprint.iacr.org/2009/286 <![CDATA[On Privacy Losses in the Trusted Agent Model (Abstract)]]>, by Paulo Mateus and Serge Vaudenay http://eprint.iacr.org/2009/286 http://eprint.iacr.org/2009/285 <![CDATA[Efficient Public Key Encryption Based on Ideal Lattices]]>, by Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa http://eprint.iacr.org/2009/285 http://eprint.iacr.org/2009/284 <![CDATA[Privacy-aware Attribute-based Encryption with User Accountability]]>, by Jin Li, Kui Ren, Bo Zhu, and Zhiguo Wan http://eprint.iacr.org/2009/284 http://eprint.iacr.org/2009/283 <![CDATA[Short and Stateless Signatures from the RSA Assumption]]>, by Susan Hohenberger and Brent Waters http://eprint.iacr.org/2009/283 http://eprint.iacr.org/2009/281 <![CDATA[Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing]]>, by Qian Wang and Cong Wang and Jin Li and Kui Ren and Wenjing Lou http://eprint.iacr.org/2009/281 http://eprint.iacr.org/2009/276 <![CDATA[Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves]]>, by Jean-Luc Beuchat and Emmanuel López-Trejo and Luis Martínez-Ramos and Shigeo Mitsunari and Francisco Rodríguez-Henríquez http://eprint.iacr.org/2009/276 http://eprint.iacr.org/2009/253 <![CDATA[Formally and Practically Relating the CK, CK-HMQV, and eCK Security Models for Authenticated Key Exchange]]>, by Cas J.F. Cremers http://eprint.iacr.org/2009/253 http://eprint.iacr.org/2009/248 <![CDATA[Cryptanalysis of the MST_3 Public Key Cryptosystem]]>, by Simon R. Blackburn, Carlos Cid and Ciaran Mullan http://eprint.iacr.org/2009/248 http://eprint.iacr.org/2009/225 <![CDATA[The Security of Abreast-DM in the Ideal Cipher Model]]>, by Jooyoung Lee and Daesung Kwon http://eprint.iacr.org/2009/225 http://eprint.iacr.org/2009/222 <![CDATA[PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware]]>, by Willi Geiselmann and Kenneth Matheis and Rainer Steinwandt http://eprint.iacr.org/2009/222 http://eprint.iacr.org/2009/208 <![CDATA[PUBLIC KEY CRYPTOGRAPHY USING PERMUTATION P-POLYNOMIALS OVER FINITE FIELDS]]>, by Rajesh P Singh and B.K.Sarma and A.Saikia http://eprint.iacr.org/2009/208 http://eprint.iacr.org/2009/195 <![CDATA[Secure Evaluation of Private Linear Branching Programs with Medical Applications]]>, by Mauro Barni and Pierluigi Failla and Vladimir Kolesnikov and Riccardo Lazzeretti and Ahmad-Reza Sadeghi and Thomas Schneider http://eprint.iacr.org/2009/195 http://eprint.iacr.org/2009/166 <![CDATA[I shall love you up to the death]]>, by Valerie Nachef and Jacques Patarin http://eprint.iacr.org/2009/166 http://eprint.iacr.org/2009/164 <![CDATA[CCA-Secure Proxy Re-Encryption without Pairings]]>, by Jun Shao and Zhenfu Cao http://eprint.iacr.org/2009/164 http://eprint.iacr.org/2009/146 <![CDATA[Transferable Anonymous Constant-Size Fair E-Cash]]>, by Georg Fuchsbauer and David Pointcheval and Damien Vergnaud http://eprint.iacr.org/2009/146 http://eprint.iacr.org/2009/129 <![CDATA[Faster and Timing-Attack Resistant AES-GCM]]>, by Emilia Kasper and Peter Schwabe http://eprint.iacr.org/2009/129 http://eprint.iacr.org/2009/122 <![CDATA[Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers]]>, by Jean-Luc Beuchat and Jérémie Detrey and Nicolas Estibals and Eiji Okamoto and Francisco Rodríguez-Henríquez http://eprint.iacr.org/2009/122 http://eprint.iacr.org/2009/062 <![CDATA[Deterministic Polynomial-Time Equivalence of Computing the CRT-RSA Secret Keys and Factoring]]>, by Subhamoy Maitra and Santanu Sarkar http://eprint.iacr.org/2009/062 http://eprint.iacr.org/2009/049 <![CDATA[Extensions of the Cube Attack based on Low Degree Annihilators]]>, by Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Wei Lei and Josef Pieprzyk http://eprint.iacr.org/2009/049 http://eprint.iacr.org/2009/028 <![CDATA[Realizing Hash-and-Sign Signatures under Standard Assumptions]]>, by Susan Hohenberger and Brent Waters http://eprint.iacr.org/2009/028 http://eprint.iacr.org/2009/026 <![CDATA[Collision Attacks on NaSHA-384/512]]>, by Zhimin Li, Licheng Wang, Daofeng Li, Yixian Yang http://eprint.iacr.org/2009/026 http://eprint.iacr.org/2008/521 <![CDATA[Generating Shorter Bases for Hard Random Lattices]]>, by Joel Alwen and Chris Peikert http://eprint.iacr.org/2008/521 http://eprint.iacr.org/2008/488 <![CDATA[Efficient Rational Secret Sharing in Standard Communication Networks]]>, by Georg Fuchsbauer and Jonathan Katz and Eric Levieil and David Naccache http://eprint.iacr.org/2008/488 http://eprint.iacr.org/2008/424 <![CDATA[Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience]]>, by Arpita Patra and Ashish Choudhary and C. Pandu Rangan http://eprint.iacr.org/2008/424 http://eprint.iacr.org/2008/280 <![CDATA[FPGA and ASIC Implementations of the $\eta_T$ Pairing in Characteristic Three]]>, by Jean-Luc Beuchat and Hiroshi Doi and Kaoru Fujita and Atsuo Inomata and Piseth Ith and Akira Kanaoka and Masayoshi Katouno and Masahiro Mambo and Eiji Okamoto and Takeshi Okamoto and Takaaki Shiga and Masaaki Shirase and Ryuji Soga and Tsuyoshi Takagi and Ananda Vithanage and Hiroyasu Yamamoto http://eprint.iacr.org/2008/280 http://eprint.iacr.org/2008/110 <![CDATA[On the Design of Secure and Fast Double Block Length Hash Functions]]>, by Zheng Gong and Xuejia Lai and Kefei Chen http://eprint.iacr.org/2008/110 http://eprint.iacr.org/2007/392 <![CDATA[Efficient Computationally Private Information Retrieval From Anonymity or Trapdoor Groups]]>, by Jonathan Trostle and Andy Parrish http://eprint.iacr.org/2007/392 http://eprint.iacr.org/2007/346 <![CDATA[Secure multi-party computation on incomplete networks]]>, by Shailesh Vaya http://eprint.iacr.org/2007/346 http://eprint.iacr.org/2007/123 <![CDATA[Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS]]>, by Berkant Ustaoglu http://eprint.iacr.org/2007/123 http://eprint.iacr.org/2006/077 <![CDATA[On Secret Sharing Schemes, Matroids and Polymatroids]]>, by Jaume Marti-Farre and Carles Padro http://eprint.iacr.org/2006/077