Sciweavers

76
Voted
CRYPTO
1998
Springer
124views Cryptology» more  CRYPTO 1998»
15 years 29 days ago
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
Ronald Cramer, Ivan Damgård
56
Voted
CRYPTO
1998
Springer
104views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES
Takeshi Shimoyama, Toshinobu Kaneko
79
Voted
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
77
Voted
CRYPTO
1998
Springer
137views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
Building PRFs from PRPs
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...
66
Voted
CRYPTO
1998
Springer
109views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop
We introduce delegation schemes wherein a user may delegate certain rights to himself, but may not safely delegate these rights to others. In our motivating application, a user ha...
Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest
77
Voted
CRYPTO
1998
Springer
119views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractabili...
Ronald Cramer, Victor Shoup
51
Voted
CRYPTO
1998
Springer
83views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
Time-Stamping with Binary Linking Schemes
We state the basic requirements for time-stamping systems applicable as the necessary support to the legal use of electronic documents. We analyze the main drawbacks of the time-st...
Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Wille...
75
Voted
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro
71
Voted
CRYPTO
1998
Springer
117views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
Relations Among Notions of Security for Public-Key Encryption Schemes
ded abstract of this paper appears in Advances in Cryptology { Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998. This is t...
Mihir Bellare, Anand Desai, David Pointcheval, Phi...