Advances in Cryptology - CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings

Front Cover
Springer Science & Business Media, 2001 - Business & Economics - 598 pages
Crypto 2001, the 21st Annual Crypto conference, was sponsored by the Int- national Association for Cryptologic Research (IACR) in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara. The conference received 156 submissions, of which the program committee selected 34 for presentation; one was later withdrawn. These proceedings contain the revised versions of the 33 submissions that were presented at the conference. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. The conference program included two invited lectures. Mark Sherwin spoke on, \Quantum information processing in semiconductors: an experimentalist’s view." Daniel Weitzner spoke on, \Privacy, Authentication & Identity: A recent history of cryptographic struggles for freedom." The conference program also included its perennial \rump session," chaired by Stuart Haber, featuring short, informal talks on late{breaking research news. As I try to account for the hours of my life that ?ew o to oblivion, I realize that most of my time was spent cajoling talented innocents into spending even more time on my behalf. I have accumulated more debts than I can ever hope to repay. As mere statements of thanks are certainly insu cient, consider the rest of this preface my version of Chapter 11.
 

What people are saying - Write a review

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

Contents

On the Impossibility of Obfuscating Programs
1
Universally Composable Commitments
19
Revocation and Tracing Schemes for Stateless Receivers
41
Self Protecting Pirates and BlackBox Traitor Tracing
63
Minimal Complete Primitives for Secure Multiparty Computation
80
Robustness for Free in Unconditional Multiparty Computation
101
Secure Distributed Linear Algebra in a Constant Number of Rounds
119
TwoParty Generation of DSA Signatures
137
How Secure Is SSL?
310
ForwardSecure Signatures with Optimal Signing and Verifying
332
Improved OnlineOffline Signature Schemes
355
An Efficient Scheme for Proving a Shuffle
368
An Identity Escrow Scheme with Appointed Verifiers
388
SessionKey Generation Using Human Passwords Only
408
Cryptanalysis of RSA Signatures with FixedPattern Padding
433
Correlation Analysis of the Shrinking Generator
440

Oblivious Transfer in the Bounded Storage Model
155
Parallel CoinTossing and ConstantRound Secure TwoParty Computation
171
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
190
On the Unpredictability of Bits of the Elliptic Curve DiffieHellman Scheme
201
IdentityBased Encryption from the Weil Pairing
213
A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding OAEP as Standardized in PKCS 1 v20
230
OAEP Reconsidered
239
RSAOAEP Is Secure under the RSA Assumption
260
Simplified OAEP for the RSA and Rabin Functions
275
Online Ciphers and the HashCBC Construction
292
Nonlinear Vector Resilient Functions
458
New Public Key Cryptosystem Using Finite Non Abelian Groups
470
Pseudorandomness from Braid Groups
486
On the Cost of Reconstructing a Secret or VSS with Optimal Reconstruction Phase
503
Secure and Efficient Asynchronous Broadcast Protocols
524
Soundness in the PublicKey Model
542
Robust Noninteractive Zero Knowledge
566
Author Index
599
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information