Download:
|
by Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith, Telcordia Technologies Inc
http://theory.lcs.mit.edu/~cis/pubs/asmith/DKOS01.ps.gz
Add To MetaCart
Abstract:
Work done while the author was at Telcordia Technologies.
Citations
|
371
|
Non-malleable cryptogra-phy
– Dolev, Dwork, et al.
- 1991
|
|
368
|
Relations among notions of security for public-key encryption schemes
– Bellare, Desai, et al.
- 1462
|
|
364
|
Practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
– Cramer, Shoup
- 1998
|
|
359
|
A Randomized Protocol for Signing Contracts
– Even, Goldreich, et al.
- 1985
|
|
352
|
How to play any mental game — a completeness theorem for protocols with honest majority
– Goldreich, Micali, et al.
- 1987
|
|
255
|
Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems
– Goldreich, Micali, et al.
- 1991
|
|
254
|
Universal One-way Hash Functions and their Cryptographic Applications. 21st STOC
– Naor, Yung
- 1989
|
|
170
|
Foundation of Cryptography - Fragments of a Book
– Goldreich
- 1995
|
|
162
|
Bit commitment using pseudo-randomness
– Naor
- 1990
|
|
142
|
Non-interactive zero knowledge
– Blum, Santis, et al.
- 1991
|
|
95
|
Non-malleable Non-interactive Zero Knowledge and Adaptive Chosen Ciphertext Security. FOCS
– Sahai
- 1999
|
|
47
|
Perfect zero-knowledge arguments for NP can be based on general complexity assumptions
– Naor, Ostrovsky, et al.
- 1998
|
|
44
|
Characterization of security notions for probabilistic private-key encryption
– Katz, Yung
|
|
37
|
Fair Games Against an All-Powerful Adversary
– Ostrovsky, Venkatesan, et al.
- 1993
|
|
31
|
R.: On concurrent zero-knowledge with preprocessing
– Crescenzo, Ostrovsky
|
|
23
|
Rapid Demonstration of Linear Relations Connected by Boolean Operators. Eurocrypt ’97
– Brands
|
|
17
|
Adaptive Zero-Knowledge and Computational Equivocation. FOCS ’96
– Beaver
|
|
14
|
Provably secure and practical identi schemes and corresponding signature schemes
– Okamoto
- 1992
|
|
6
|
Necessary and sucient assumptions for non-interactive zero-knowledge proofs of knowledge for all np relations
– Santis, Crescenzo, et al.
|
|
6
|
The non-malleability lectures. Available from the author
– Dwork
|
|
6
|
Efficient Non-Malleable Commitment Schemes. CRYPTO
– Fischlin, Fischlin
- 2000
|
