These are the proceedings of Eurocrypt 2007, the 26th Annual IACR EurocryptConference. The conference was sponsored by the International Association forCryptologic Research (IACR; see www.iacr.org), this year in cooperation withthe Research Group on Mathematics Applied to Cryptography at UPC and theResearch Group on Information Security at UMA. The Eurocrypt 2007 ProgramCommittee (PC) consisted of 24 members whose names are listed on the nextpage.The PC decided on several policies: zero PC papers - no Program Committeemember could submit papers; optional anonymity - authors could choose toanonymize their papers or not. Anonymous papers were treated as usual, i.e.,the author’s identity was not revealed to the PC. The submission software usedwas “Web Submission and Review Software” written and maintained by ShaiHalevi. There were 173 papers submitted to the conference and the PC chose33 of them. Each paper was assigned to at least three PC members, who eitherhandled it themselves or assigned it to an external referee. After the reviews weresubmitted, the committee deliberated both online for several weeks and finallyin a face-to-face meeting held in Paris. In addition to notification of the decisionof the committee, authors received reviews. Our goal was to provide meaningfulcomments to authors of all papers (both those selected for the program andthose not selected). The default for any report given to the committee was thatit should be available to the authors as well.
Author(s): Marc Stevens, Arjen Lenstra, Benne de Weger (auth.), Moni Naor (eds.)
Series: Lecture Notes in Computer Science 4515
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007
Language: English
Pages: 591
Tags: Data Encryption; Computer Communication Networks; Systems and Data Security; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Management of Computing and Information Systems
Front Matter....Pages -
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities....Pages 1-22
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist....Pages 23-33
The Collision Intractability of MDC-2 in the Ideal-Cipher Model....Pages 34-51
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries....Pages 52-78
Revisiting the Efficiency of Malicious Two-Party Computation....Pages 79-96
Efficient Two-Party Secure Computation on Committed Inputs....Pages 97-114
Universally Composable Multi-party Computation Using Tamper-Proof Hardware....Pages 115-128
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model....Pages 129-147
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability....Pages 148-168
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility....Pages 169-186
Zero Knowledge and Soundness Are Symmetric....Pages 187-209
Mesh Signatures....Pages 210-227
The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks....Pages 228-245
Batch Verification of Short Signatures....Pages 246-263
Cryptanalysis of SFLASH with Slightly Modified Parameters....Pages 264-275
Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy....Pages 276-290
Secure Computation from Random Error Correcting Codes....Pages 291-310
Round-Efficient Secure Computation in Point-to-Point Networks....Pages 311-328
Atomic Secure Multi-party Multiplication with Low Communication....Pages 329-346
Cryptanalysis of the Sidelnikov Cryptosystem....Pages 347-360
Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables....Pages 361-378
An L (1/3 + ε ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves....Pages 379-393
General Ad Hoc Encryption from Exponent Inversion IBE....Pages 394-411
Non-interactive Proofs for Integer Multiplication....Pages 412-429
Ate Pairing on Hyperelliptic Curves....Pages 430-447
Ideal Multipartite Secret Sharing Schemes....Pages 448-465
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit....Pages 466-481
Divisible E-Cash Systems Can Be Truly Anonymous....Pages 482-497
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security....Pages 498-516
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly....Pages 517-533
Feistel Networks Made Public, and Applications....Pages 534-554
Oblivious-Transfer Amplification....Pages 555-572
Simulatable Adaptive Oblivious Transfer....Pages 573-590
Back Matter....Pages -
