Sciweavers

CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
CRYPTO
2001
Springer
162views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
New Public Key Cryptosystem Using Finite Non Abelian Groups
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. I...
Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongt...
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Two-Party Generation of DSA Signatures
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
Philip D. MacKenzie, Michael K. Reiter
CRYPTO
2001
Springer
202views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Revocation and Tracing Schemes for Stateless Receivers
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
Dalit Naor, Moni Naor, Jeffery Lotspiech
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
Yehuda Lindell
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
CRYPTO
2001
Springer
139views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Soundness in the Public-Key Model
The public-key model for interactive proofs has proved to be quite effective in improving protocol efficiency [CGGM00]. We argue, however, that its soundness notion is more subtle...
Silvio Micali, Leonid Reyzin
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin