Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations |
Disambiguate
Tables:
DMCA
Cryptography in Constant Parallel Time (2007)
Cached
Download Links
[www.cs.princeton.edu]
[www.wisdom.weizmann.ac.il]
[www.eng.tau.ac.il]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Benny Applebaum
Citations:
3 - 0 self
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
3814
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
- Rivest, Shamir, et al. - 1978
1373
Probabilistic Encryption
- Goldwasser, Micali - 1984
1233
The knowledge complexity of interactive proof systems
- GOLDWASSER, MICALI, et al. - 1989
1189
Communication theory of secrecy systems
- Shannon - 1949
1031
The complexity of theorem-proving procedures
- Cook - 1971
952
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks
- Goldwasser, Micali, et al. - 1988
853
Pseudorandom generators from any oneway function", 21st STOC
- Levin, Luby - 1989
838
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation
- Ben-Or, Goldwasser, et al. - 1988
818
Universally Composable Security: A New Paradigm for Cryptographic Protocols
- Canetti - 2002
793
Proof Verification and the Hardness of Approximation Problems
- Arora, Lund, et al. - 1998
744
How to construct random functions
- Goldreich, Goldwasser, et al. - 1986
657
How togenerate cryptographically strong sequences of pseudo random bits", 23rd FOCS
- Blum, Micali - 1982
606
Optimization, approximation, and complexity classes
- PAPADIMITRIOU, YANNAKAKIS - 1988
553
Multiparty Unconditionally Secure Protocols
- Chaum, Crepeau, et al. - 1988
488
Non-interactive and information-theoretic secure verifiable secret sharing
- Pedersen - 1991
457
Security and Composition of Multiparty Cryptographic Protocols
- Canetti
434
A Hard-Core Predicate for all One-Way Functions
- Goldreich, Levin - 1989
413
Probabilistic Checking of Proofs: A New Characterization of NP
- Arora, Safra - 1998
395
A public key cryptosystem and a signature scheme based (In discrete logarithms
- Gamal - 1985
355
Digitalized signatures and public key functions as intractable as factorization
- Rabin - 1979
347
Universal one-way hash functions and their cryptographic applications
- Naor, Yung - 1989
324
Foundations of Cryptography: Basic Tools
- Goldreich
324
Constant depth circuits, Fourier transform and learnability
- Linial, Mansour, et al. - 1993
304
Founding cryptography on oblivious transfer
- Kilian - 1988
291
public-key cryptosystem based on algebraic coding theory
- McEliece - 1978
277
Small-bias probability spaces: Efficient constructions and applications
- Naor, Naor - 1993
271
Bit commitment using pseudorandomness
- Naor - 1991
268
Bounded-width polynomial-size branching programs recognize exactly those languages in NC
- Barrington - 1989
259
Nondeterministic Space is Closed Under Complementation
- Immerman - 1988
245
A public-key cryptosystem with worst-case/average-case equivalence
- Ajtai, Dwork - 1997
245
Privacy preserving auctions and mechanism design, in
- Naor, Pinkas, et al. - 1999
244
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
- Alon, Babai, et al. - 1986
233
Pseudorandom generators for space-bounded computation
- Nisan - 1992
225
One-way functions are necessary and sufficient for secure signature
- Rompel - 1990
209
Unbiased bits from sources of weak randomness and probabilistic communication complexity
- Chor, Goldreich
191
Generating hard instances of lattice problems
- Ajtai - 2004
183
Multiple Non-Interactive Zero Knowledge Proofs Under General Assumptions
- Feige, Lapidot, et al. - 1999
179
Number-Theoretic Constructions of Efficient Pseudo-Random Functions
- Naor, Reingold - 1997
168
Cryptography and computer privacy
- Feistel - 1973
166
Foundations of Cryptography: Basic Applications, volume 2
- Goldreich - 2004
162
How to Construct Constant-Round Zero-Knowledge Proof Systems for NP
- Goldreich, Kahan - 1996
161
Noise-tolerant learning, the parity problem, and the statistical query model
- Blum, Kalai, et al.
143
flipping by telephone: a protocol for solving impossible problems
- Blum, “Coin - 1982
131
Modern cryptography, probabilistic proofs and pseudorandomness, volume 17 of Algorithms and Combinatorics
- Goldreich - 1999
128
An efficient probabilistic public key encryption scheme which hides all partial information
- Blum, Goldwasser - 1985
125
One-way functions are essential for complexity based cryptography
- Impagliazzo, Luby - 1989
124
Relations between average case complexity and approximation complexity
- Feige - 2002
108
Collision free hash functions and public key signature schemes
- Damg˚ard - 1988
105
Cryptographic primitives based on hard learning problems
- Blum, Furst, et al. - 1993
98
Lossless condensers, unbalanced expanders, and extractors
- Ta-Shma, Umans, et al.
89
A proof of Yao’s protocol for secure two-party computation. Electronic Colloquium on Computational Complexity
- Lindell, Pinkas - 2004
77
On the existence of pseudorandom generators
- Goldreich, Krawcyk, et al. - 1988
73
Cryptographic hardness of distribution-specific learning
- Kharitonov - 1993
71
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Damg˚ard, Pedersen, et al. - 1993
67
Complete characterization of security notions for probabilistic private-key encryption
- Katz, Yung - 1999
64
Correcting errors without leaking partial information
- Dodis, Smith - 2005
64
Collision-free hashing from lattice problems
- Goldreich, Goldwasser, et al. - 1996
60
On the cryptographic applications of random functions
- Goldreich, Goldwasser, et al. - 1985
59
A structured design of substitution-permutation encryption networks
- Kam, Davida - 1979
55
More on average case vs approximation complexity
- Alekhnovich - 2003
55
Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract
- Babai, Nisan, et al. - 1989
54
P.: The round complexity of secure protocols (extended abstract
- Beaver, Micali, et al. - 1990
51
Candidate one-way functions based on expander graphs. Cryptology ePrint Archive
- Goldreich
47
Synthesizers and their application to the parallel construction of pseudo-random functions
- Naor, Reingold - 1995
45
New lattice based cryptographic constructions
- Regev - 2003
36
Yuval Ishai, and Eyal Kushilevitz. Cryptography in ncO
- Applebaum - 2006
35
The Round Complexity of Secure Protocols
- Rogaway - 1990
30
How to sign given any trapdoor permutation
- Bellare, Micali - 1992
29
How to play any mental game (extended abstract
- Goldreich, Micali, et al. - 1987
28
Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- Agrawal, Allender, et al. - 1998
28
Omer Reingold, Salil Vadhan, and Avi Wigderson. Extractors: Optimal up to constant factors
- Lu - 2003
27
L.: Finding collisions on a public road, or do secure hash functions need secret coins
- Hsiao, Reyzin - 2004
27
The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem
- Lyubashevsky - 2005
24
and Yuval Roichman. Random Cayley graphs and expanders
- Alon - 1994
23
On ε-Biased Generators
- Mossel, Shpilka, et al. - 2003
22
Locally Random Reductions in Interactive Complexity Theory
- Feigenbaum - 1993
21
Ronen Shaltiel, and Avi Wigderson. Computational analogues of entropy
- Barak - 2003
20
A Note on Computational Indistinguishability
- Goldreich - 1990
19
Certifying permutations: Noninteractive zero-knowledge based on anytrapdoor permutation. Journal of Cryptology
- Bellare, Yung - 1996
18
On the power of the randomized iterate
- Haitner, Harnik, et al. - 2006
18
Algorithmic introduction to coding theory (lecture notes
- Sudan - 2001
17
Yuval Ishai, and Eyal Kushilevitz. Computationally private randomizing polynomials and their applications
- Applebaum - 2006
16
McEliece public key cryptosystems using algebraicgeometric codes. Des
- Janwa, Moreno - 1996
15
Impagliazzo and Moni Naor, Efficient cryptographic schemes provably as secure as subset sum
- Russell - 1996
13
Yuval Ishai, and Eyal Kushilevitz. Efficient multi-party computation over rings
- Cramer, Fehr - 2003
13
On the minimal hardware complexity of pseudorandom function generators
- Krause, Lucks - 2001
12
SALIL VADHAN, AND AVI WIGDERSON: Randomnessefficient low degree tests and short PCPs via epsilon-biased sets
- BEN-SASSON, SUDAN - 2003
12
On pseudorandom generators
- Cryan, Miltersen - 2001
12
One-way permutations
- Hastad - 1987
11
Salil Vadhan. Notions of reducibility between cryptographic primitives
- Reingold, Trevisan - 2004
11
On garbled circuits and constant round secure function evaluation, tech
- Tate, Xu - 2003
10
Yuval Ishai, and Eyal Kushilevitz. On pseudorandom generators with linear stretch
- Applebaum - 2006
9
bounds for pseudorandom number generators
- Kharitonov, Goldberg, et al. - 1989
7
Randomized methods in computation - lecture notes
- Goldreich - 2001
5
Increasing the Expansion of Pseudorandom Generators
- Goldreich, Micali - 1984
4
Relaxing chosen ciphertext security of encryption schemes
- Canetti, Krawczyk, et al. - 2003
2
Universal sequential search problems. PINFTRANS: Problems of Information Transmission (translated from Problemy Peredachi
- Levin - 1973
2
Constructions of low-degree and error-correcting e-biased generators
- Shpilka - 2006
1
Yuval Ishai, and Eyal Kushilevitz. On one-way functions with optimal locality. Unpublished manuscript available at http://www.cs.technion.ac.il/∼abenny
- Applebaum - 2005
1
Practicle and provably-commitment schemes from collision-free hashing
- Halevi, Micali - 1996