Sciweavers

EUROCRYPT
1995
Springer
14 years 3 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
CRYPTO
1995
Springer
111views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
Fast Key Exchange with Elliptic Curve Systems
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
Richard Schroeppel, Hilarie K. Orman, Sean W. O'Ma...
CRYPTO
1995
Springer
140views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
Bucket Hashing and its Application to Fast Message Authentication
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
Phillip Rogaway
CRYPTO
1995
Springer
118views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
MDx-MAC and Building Fast MACs from Hash Functions
Bart Preneel, Paul C. van Oorschot
CRYPTO
1995
Springer
100views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, M...
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
CRYPTO
1995
Springer
89views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
Secure Signature Schemes based on Interactive Protocols
Ronald Cramer, Ivan Damgård
CRYPTO
1995
Springer
91views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
Some Remarks on Lucas-Based Cryptosystems
We review the well-known relation between Lucas sequences and exponentiation. This leads to the observation that certain public-key cryptosystems that are based on the use of Lucas...
Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstr...
30
Voted
CRYPTO
1995
Springer
101views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
Robustness Principles for Public Key Protocols
Abstract: We present a number of attacks, some new, on public key protocols. We also advance a number of principles which may help designers avoid many of the pitfalls, and help at...
Ross J. Anderson, Roger M. Needham
CRYPTO
1995
Springer
93views Cryptology» more  CRYPTO 1995»
14 years 3 months ago
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
Mihir Bellare, Roch Guérin, Phillip Rogaway