Advances in Cryptology — CRYPTO ’95: 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27–31, 1995. Proceedings, Volume 12
Springer Berlin Heidelberg, Aug 16, 1995 - Computers - 465 pages
The Crypto ’95 conference was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer - ciety Technical Committee on Security and Privacy, and the Computer Science Department of the University of California, Santa Barbara. It took place at the University of California, Santa Barbara, from August 27-31, 1995. This was the fifteenth annual Crypto conference; all have been held at UCSB. For the second time, proceedings were available at the conference. The General Chair, Stafford Tavares, was responsible for local organization and registration. The Program Committee considered 151 papers and selected 36 for pres- tation. There were also two invited talks. Robert Morris, Sr. gave a talk on “Ways of Losing Information,” which included some non-cryptographic means of leaking secrets that are often overlooked by cryptographers. The second talk, “Cryptography - Myths and Realities,” was given by Adi Shamir, this year’s IACR Distinguished Lecturer. Shamir is the second person to receive this honor, the first having been Gus Simmons at Crypto ’94. These proceedings contain revised versions of the 36 contributed talks. Each paper was sent to at least three members of the program committee for c- ments. Revisions were not checked on their scientific aspects. Some authors will write final versions of their papers for publication in refereed journals. Of course, the authors bear full responsibility for the contents of their papers.
What people are saying - Write a review
We haven't found any reviews in the usual places.
MAC and Hash
New Methods for Message Authentication Using
Bucket Hashing and its Application to Fast Message Authentication
15 other sections not shown
Other editions - View all
active attacks Advances in Cryptology adversary algorithm Alice Alice and Bob assume assumption authentication Bit Commitment block cipher byte choose chosen chosen ciphertext attacks ciphertext client codeword collision commitment scheme complexity Computer Science construction Crépeau Cryptanalysis Crypto cryptographic cryptosystems decryption denote digital signature discrete logarithm distribution efficient elliptic curve encryption equations Eurocrypt exponentiation factor GBCX given hash function honest IEEE implementation input integer key escrow large primes Lemma linear approximations linear cryptanalysis LNCS method Micali mod q modular multiplications modulo Notes in Computer Oblivious Transfer obtain output pairs participants parties permutations plaintexts polynomial precomputed probability problem Proc Proceedings properties protocol prove pseudorandom public key reconstruction result round RSA-S1M secret key secret sharing scheme secret vectors sends server server-aided signature scheme simulator Springer-Verlag step string Theorem trustees verifier zero-knowledge proofs