Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings

Front Cover
Victor Shoup
Springer Science & Business Media, 2005 - Business & Economics - 568 pages
These are the proceedings of Crypto 2005, the 25th Annual International Cr- tology Conference. The conference was sponsored by the International Assoc- tion for Cryptologic Research (IACR) in cooperation with the IEEE Computer ScienceTechnicalCommitteeonSecurityandPrivacyandtheComputerScience DepartmentoftheUniversityofCaliforniaatSantaBarbara.Theconferencewas held in Santa Barbara, California, August 14-18, 2005. Theconferencereceived178submissions, outofwhichtheprogramcommittee selected33forpresentation.Theselectionprocesswascarriedoutbytheprogram committee via an "online" meeting. The authors of selected papers had a few weeks to prepare ?nal versions of their papers, aided by comments from the reviewers. However, most of these revisions were not subject to any editorial review. This year, a "Best Paper Award" was given to Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu, for their paper "Finding Collisions in the Full SHA-1." The conference program included two invited lectures. Ralph Merkle del- ered an IACR Distinguished Lecture, entitled "The Development of Public Key Cryptography: a PersonalView; and Thoughts on Nanotechnology."Dan Boneh gave an invited talk, entitled "Bilinear Maps in Cryptography." We continued the tradition of a "rump session," featuring short, informal presentations (usually serious, sometimes entertaining, and occasionally both). ~ The rump session was chaired this year by Phong Q. Nguy^ en.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Efficient Collision Search Attacks on SHA0
1
Finding Collisions in the Full SHA1
17
Pebbling and Proofs of Work
37
Composition Does Not Imply Adaptive Security
55
On the Discrete Logarithm Problem on Algebraic Tori
66
A Practical Attack on a Braid Group Based Cryptographic Protocol
86
A Practical Attack on Bluetooth Encryption
97
Unconditional Characterizations of Noninteractive ZeroKnowledge
118
Secure Communications over Insecure Channels Based on Short Authenticated Strings
309
On Codes Matroids and Secure Multiparty Computation from Linear Secret Sharing Schemes
327
BlackBox Secret Sharing from Primitive Sets in Algebraic Number Fields
344
Secure Computation Without Authentication
361
ConstantRound Multiparty Computation Using a BlackBox Pseudorandom Generator
378
Secure Computation of ConstantDepth Circuits with Applications to Database Search Problems
395
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
412
How to Construct a Hash Function
430

Impossibility and Feasibility Results for Zero Knowledge with Public Keys
135
CommunicationEfficient Noninteractive Proofs of Knowledge with Online Extractors
152
A Formal Treatment of Onion Routing
169
Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
188
Consistency Properties Relation to Anonymous IBE and Extensions
205
Private Searching on Streaming Data
223
PrivacyPreserving Set Operations
241
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
258
Generic Transformation for Scalable Broadcast Encryption Schemes
276
Authenticating Pervasive Devices with Human Protocols
293
On the Generic Insecurity of the Full Domain Hash
449
New Monotones and Lower Bounds in Unconditional TwoParty Computation
467
OneWay SecretKey Agreement and Applications to Circuit Polarization and Immunization of PublicKey Encryption
478
A Quantum Cipher with Near Optimal KeyRecycling
494
An Efficient CDHBased Signature Scheme with a Tight Security Reduction
511
Improved Security Analyses for CBC MACs
527
A HighPerformance Secure DiffieHellman Protocol Extended Abstract
546
Author Index
567
Copyright

Other editions - View all

Common terms and phrases