On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Non-interactive and non-malleable commitment
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Security-preserving hardness-amplification for any regular one-way function
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudo-random functions and factoring (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Resettable zero-knowledge (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Complete characterization of security notions for probabilistic private-key encryption
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A Protocol to Achieve Independence in Constant Rounds
IEEE Transactions on Parallel and Distributed Systems
Funkspiel schemes: an alternative to conventional tamper resistance
Proceedings of the 7th ACM conference on Computer and communications security
Xor-trees for efficient anonymous multicast and reception
ACM Transactions on Information and System Security (TISSEC)
Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Theoretical Computer Science - Algorithmic learning theory
Concurrent zero-knowledge with timing, revisited
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
On Pseudorandom Generators in NC
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Spectral Bounds on General Hard Core Predicates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Improved Pseudo-random Generator Based on Discrete Log
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Note on the Round-Complexity of Concurrent Zero-Knowledge
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Soundness in the Public-Key Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Pseudorandomness from Braid Groups
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Robust Non-interactive Zero Knowledge
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Min-round Resettable Zero-Knowledge in the Public-Key Model
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
How to Convert the Flavor of a Quantum Bit Commitment
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Hash Functions: From Merkle-Damgård to Shoup
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Efficient Amplification of the Security of Weak Pseudo-random Function Generators
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Proofs of Security for the Unix Password Hashing Algorithm
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Practical Construction and Analysis of Pseudo-Randomness Primitives
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Oblivious Polynomial Evaluation and Oblivious Neural Learning
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Boosting in the presence of noise
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Deterministic approximation of the cover time
Random Structures & Algorithms
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998
Journal of the ACM (JACM)
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Key agreement from weak bit agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Impossibility of Obfuscation with Auxiliary Input
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A model and architecture for pseudo-random generation with applications to /dev/random
Proceedings of the 12th ACM conference on Computer and communications security
Security of erasable memories against adaptive adversaries
Proceedings of the 2005 ACM workshop on Storage security and survivability
Learning DNF from random walks
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Boosting in the presence of noise
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Universal test for quantum one-way permutations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
ICML '06 Proceedings of the 23rd international conference on Machine learning
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Progress in computational complexity theory
Journal of Computer Science and Technology
Compression of samplable sources
Computational Complexity
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Oblivious polynomial evaluation and oblivious neural learning
Theoretical Computer Science
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
Separating Models of Learning from Correlated and Uncorrelated Data
The Journal of Machine Learning Research
Statistically-hiding commitment from any one-way function
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Provably secure authenticated group Diffie-Hellman key exchange
ACM Transactions on Information and System Security (TISSEC)
Foundations and Trends® in Theoretical Computer Science
Security under key-dependent inputs
Proceedings of the 14th ACM conference on Computer and communications security
The unified theory of pseudorandomness: guest column
ACM SIGACT News
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Authenticating ad hoc networks by comparison of short digests
Information and Computation
HMAC is a randomness extractor and applications to TLS
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
Comparing Notions of Computational Entropy
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Zero Knowledge and Soundness Are Symmetric
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Oblivious-Transfer Amplification
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Information Security and Cryptology
Weak Pseudorandom Functions in Minicrypt
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Circular-Secure Encryption from Decision Diffie-Hellman
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
The Complexity of Distinguishing Markov Random Fields
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
An Improved Robust Fuzzy Extractor
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Worst-Case to Average-Case Reductions Revisited
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The complexity of online memory checking
Journal of the ACM (JACM)
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The practical subtleties of biometric key generation
SS'08 Proceedings of the 17th conference on Security symposium
A note on universal composable zero-knowledge in the common reference string model
Theoretical Computer Science
A note on the feasibility of generalised universal composability†
Mathematical Structures in Computer Science
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Black-Box Constructions of Two-Party Protocols from One-Way Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Weak Verifiable Random Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Towards a Theory of Extractable Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption
Information Security and Cryptology --- ICISC 2008
On the Security Loss in Cryptographic Reductions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Key Agreement from Close Secrets over Unsecured Channels
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
A Leakage-Resilient Mode of Operation
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Optimal Randomness Extraction from a Diffie-Hellman Element
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
A New Randomness Extraction Paradigm for Hybrid Encryption
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Non-malleability amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proceedings of the forty-first annual ACM symposium on Theory of computing
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Folklore, practice and theory of robust combiners
Journal of Computer Security
Preserving Privacy versus Data Retention
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Extracting Computational Entropy and Learning Noisy Linear Functions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
QUAD: A multivariate stream cipher with provable security
Journal of Symbolic Computation
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
Proceedings of the 16th ACM conference on Computer and communications security
More efficient DDH pseudorandom generators
Designs, Codes and Cryptography
Simple extractors via constructions of cryptographic pseudo-random generators
Theoretical Computer Science
Bounds on the efficiency of black-box commitment schemes
Theoretical Computer Science
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Single database private information retrieval implies oblivious transfer
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient pseudorandom generators based on the DDH assumption
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Towards a separation of semantic and CCA security for public key encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A note on universal composable zero knowledge in common reference string model
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A note on the feasibility of generalized universal composability
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Simulatable VRFs with applications to multi-theorem NIZK
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Concurrent statistical zero-knowledge arguments for NP from one way functions
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Authenticated key exchange and key encapsulation in the standard model
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Towards key-dependent message security in the standard model
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Protocols and lower bounds for failure localization in the internet
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Precise concurrent zero knowledge
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
New constructions for UC secure computation using tamper-proof hardware
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Semi-honest to malicious oblivious transfer: the black-box way
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Saving private randomness in one-way functions and pseudorandom generators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
The grace of quadratic norms: some examples
Pillars of computer science
Efficiency improvements in constructing pseudorandom generators from one-way functions
Proceedings of the forty-second ACM symposium on Theory of computing
Practical leakage-resilient pseudorandom generators
Proceedings of the 17th ACM conference on Computer and communications security
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
A zero-one law for cryptographic complexity with respect to computational UC security
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Cryptographic extraction and key derivation: the HKDF scheme
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the round complexity of zero-knowledge proofs based on one-way permutations
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Efficient password-based authenticated key exchange protocol in the UC framework
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
On the Implementation of Huge Random Objects
SIAM Journal on Computing
General hardness amplification of predicates and puzzles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
After-the-fact leakage in public-key encryption
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Unconditional and composable security using a single stateful tamper-proof hardware token
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Homomorphic encryption: from private-key to public-key
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
On the black-box complexity of optimally-fair coin tossing
TCC'11 Proceedings of the 8th conference on Theory of cryptography
On the complexity of non-adaptively increasing the stretch of pseudorandom generators
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Limits on the power of zero-knowledge proofs in cryptographic constructions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Towards non-black-box lower bounds in cryptography
TCC'11 Proceedings of the 8th conference on Theory of cryptography
On black-box separations among injective one-way functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Repeated matching pennies with limited randomness
Proceedings of the 12th ACM conference on Electronic commerce
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Constant-round non-malleable commitments from any one-way function
Proceedings of the forty-third annual ACM symposium on Theory of computing
Concurrent composition in the bounded quantum storage model
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Some notions of entropy for cryptography
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Sharp lower bounds on the extractable randomness from non-uniform sources
Information and Computation
Quantum Information & Computation
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
On randomness extraction in elliptic curves
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Quantum commitments from complexity assumptions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On constructing 1-1 one-way functions
Studies in complexity and cryptography
Collision-free hashing from lattice problems
Studies in complexity and cryptography
Studies in complexity and cryptography
Average case complexity, revisited
Studies in complexity and cryptography
Studies in complexity and cryptography
Leftover Hash Lemma, revisited
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Physically uncloneable functions in the universal composition framework
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
E-MACs: towards more secure and more efficient constructions of secure channels
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Cryptography in constant parallel time
Cryptography in constant parallel time
Non-interactive opening for ciphertexts encrypted by shared keys
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Black-Box Constructions of Protocols for Secure Computation
SIAM Journal on Computing
Kakeya Sets, New Mergers, and Old Extractors
SIAM Journal on Computing
A scalable password-based group key exchange protocol in the standard model
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Pseudorandomness and derandomization
XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Efficient pseudorandom generators from exponentially hard one-way functions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Hardness of distinguishing the MSB or LSB of secret keys in diffie-hellman schemes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Simple and tight bounds for information reconciliation and privacy amplification
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Discriminative learning can succeed where generative learning fails
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Simple extractors via constructions of cryptographic pseudo-random generators
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Bounds on the efficiency of “black-box” commitment schemes
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On related-secret pseudorandomness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Separating models of learning from correlated and uncorrelated data
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Improved efficiency for CCA-secure cryptosystems built using identity-based encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
On tolerant cryptographic constructions
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
On hardness amplification of one-way functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficiently constructible huge graphs that preserve first order properties of random graphs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Upper and lower bounds on black-box steganography
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Gateway-oriented password-authenticated key exchange protocol in the standard model
Journal of Systems and Software
Unconditional characterizations of non-interactive zero-knowledge
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Secure communications over insecure channels based on short authenticated strings
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Reducing complexity assumptions for statistically-hiding commitment
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On robust combiners for oblivious transfer and other primitives
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Mercurial commitments with applications to zero-knowledge sets
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Public traceability in traitor tracing schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
An encoding invariant version of polynomial time computable distributions
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Fully homomorphic encryption over the integers
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Universal one-way hash functions via inaccessible entropy
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Constant-Round non-malleable commitments from sub-exponential one-way functions
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On the power of the randomized iterate
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Round-optimal composable blind signatures in the common reference string model
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Robust fuzzy extractors and authenticated key agreement from close secrets
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Oblivious transfer and linear functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Concurrent zero-knowledge with timing, revisited
Theoretical Computer Science
The Twist-AUgmented technique for key exchange
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
QUAD: a practical stream cipher with provable security
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Luby-Rackoff ciphers from weak round functions?
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient primitives from exponentiation in Zp
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Statistically-Hiding quantum bit commitment from approximable-preimage-size quantum one-way function
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Resettable public-key encryption: how to encrypt on a virtual machine
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Mercurial commitments: minimal assumptions and efficient constructions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Pseudorandom generators from one-way functions: a simple construction for any hardness
TCC'06 Proceedings of the Third conference on Theory of Cryptography
On the complexity of parallel hardness amplification for one-way functions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
XMSS - a practical forward secure signature scheme based on minimal security assumptions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
A new pseudorandom generator from collision-resistant hash functions
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Cryptography from learning parity with noise
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Pseudorandom generators with long stretch and low locality from random local one-way functions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Characterizing pseudoentropy and simplifying pseudorandom generator constructions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Round-Optimal privacy-preserving protocols with smooth projective hash functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
From non-adaptive to adaptive pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Computational extractors and pseudorandomness
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Identity-Based (lossy) trapdoor functions and applications
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Dual projective hashing and its applications -- lossy trapdoor functions and more
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
International Journal of Applied Cryptography
On the Power of the Randomized Iterate
SIAM Journal on Computing
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
Public-Key cryptography from new multivariate quadratic assumptions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
New definitions and separations for circular security
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Correlated product security from any one-way function
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Black-box reductions and separations in cryptography
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
A characterization of non-interactive instance-dependent commitment-schemes (NIC)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Practical leakage-resilient symmetric cryptography
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Sparse extractor families for all the entropy
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Practical leakage-resilient pseudorandom objects with minimum public randomness
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Hardness preserving reductions via cuckoo hashing
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Garbling XOR gates "for free" in the standard model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the security of the Winternitz one-time signature scheme
International Journal of Applied Cryptography
Non-black-box simulation from one-way functions and applications to resettable security
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Witness encryption and its applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Classical hardness of learning with errors
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Splittable pseudorandom number generators using cryptographic hashing
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
The truth behind the myth of the folk theorem
Proceedings of the 5th conference on Innovations in theoretical computer science
Encoding Invariance in Average Case Complexity
Theory of Computing Systems
| Hi-index | 0.01 |
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a pseudorandom generator from any one-way function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator if and only if there is a one-way function.