How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Efficiency considerations in using semi-random sources
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
How discreet is the discrete log?
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the existence of pseudorandom generators
CRYPTO '88 Proceedings on Advances in cryptology
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The discrete log is very discreet
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Learning decision trees using the Fourier spectrum
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the existence of bit commitment schemes and zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
Zero knowledge proofs of knowledge in two rounds
CRYPTO '89 Proceedings on Advances in cryptology
Non-interactive oblivious transfer and applications
CRYPTO '89 Proceedings on Advances in cryptology
On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
How to simultaneously exchange secrets by general assumptions
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Learning DNF over the uniform distribution using a quantum example oracle
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Fundamentals of computing (a cheatlist)
ACM SIGACT News
Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Perfectly one-way probabilistic hash functions (preliminary version)
STOC '98 Proceedings of the thirtieth 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
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computational sample complexity and attribute-efficient learning
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
More efficient PAC-learning of DNF with membership queries under the uniform distribution
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Design of practical and provably good random number generators
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Pseudo-random functions and factoring (extended abstract)
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
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On Pseudorandom Generators in NC
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Spectral Bounds on General Hard Core Predicates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum DNF Learnability Revisited
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Fast Correlation Attacks through Reconstruction of Linear Polynomials
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
On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme
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
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Interactive Proofs with Provable Security Against Honest Verifiers
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Certifying Cryptographic Tools: The Case of Trapdoor Permutations
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Incremental Cryptography: The Case of Hashing and Signing
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
All Bits ax+b mod p are Hard (Extended Abstract)
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Hard Sets and Pseudo-random Generators for Constant Depth Circuits
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
The Bit Security of Paillier's Encryption Scheme and Its Applications
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
Cryptanalysis of a Pseudorandom Generator Based on Braid Groups
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: 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
Mutually Independent Commitments
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
On Learning Correlated Boolean Functions Using Statistical Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Efficient Construction of (Distributed) Verifiable Random Functions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
How to Utilize the Randomness of Zero-Knowledge Proofs
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
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
Lower bounds on the efficiency of encryption and digital signature schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
Annals of Mathematics and Artificial Intelligence
Sharing Random Bits with No Process Coordination
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
On using extended statistical queries to avoid membership queries
The Journal of Machine Learning Research
One-way permutations and self-witnessing languages
Journal of Computer and System Sciences
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)
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Journal of Computer and System Sciences
Decoding of Reed-Muller codes with polylogarithmic complexity
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Using nondeterminism to amplify hardness
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New notions of security: achieving universal composability without trusted setup
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Completeness in two-party secure computation: a computational view
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Towards proving strong direct product theorems
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
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
Universal test for quantum one-way permutations
Theoretical Computer Science - Mathematical foundations of computer science 2004
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Quantum lower bounds for the Goldreich-Levin problem
Information Processing Letters
Derandomizing Arthur-Merlin games using hitting sets
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
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Computational Complexity
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Authenticating ad hoc networks by comparison of short digests
Information and Computation
Improving the novel three-party encrypted key exchange protocol
Computer Standards & Interfaces
Lossy trapdoor functions and their applications
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
List-decoding reed-muller codes over small fields
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Decodability of group homomorphisms beyond the johnson bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Agnostically learning decision trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Uniform direct product theorems: simplified, optimized, and derandomized
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness amplification proofs require majority
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
An improved list decoding algorithm for the second order Reed---Muller codes and its applications
Designs, Codes and Cryptography
Semantic security for the McEliece cryptosystem without random oracles
Designs, Codes and Cryptography
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Feistel Networks Made Public, and Applications
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Oblivious Transfer Based on the McEliece Assumptions
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
The Complexity of Local List Decoding
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
Error correction up to the information-theoretic limit
Communications of the ACM - Being Human in the Digital Age
Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Chosen Ciphertext Secure Public Key Encryption with a Simple Structure
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A New Attack on the LEX Stream Cipher
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Security Amplification for Interactive Cryptographic Primitives
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
The Security of All Bits Using List Decoding
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
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
Practical Chosen Ciphertext Secure Encryption from Factoring
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Verifiable Random Functions from Identity-Based Key Encapsulation
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
List decoding tensor products and interleaved codes
Proceedings of the forty-first annual ACM symposium on Theory of computing
New direct-product testers and 2-query PCPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
On cryptography with auxiliary input
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
Entropic security in quantum cryptography
Quantum Information Processing
List Decoding of Binary Codes---A Brief Survey of Some Recent Results
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Cryptanalysis of two three-party encrypted key exchange protocols
Computer Standards & Interfaces
Extracting Computational Entropy and Learning Noisy Linear Functions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Storage Efficient Redactable Signature in the Standard Model
ISC '09 Proceedings of the 12th International Conference on Information Security
QUAD: A multivariate stream cipher with provable security
Journal of Symbolic Computation
Variations on a theme by Akl and Taylor: Security and tradeoffs
Theoretical Computer Science
Practical electronic lotteries with offline TTP
Computer Communications
An efficient forward private RFID protocol
Proceedings of the 16th ACM conference on Computer and communications security
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
A New Hard-Core Predicate of Paillier's Trapdoor Function
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Self-encryption scheme for data security in mobile devices
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Quantum lower bounds for the Goldreich--Levin problem
Information Processing Letters
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
An efficient pseudo-random generator provably as secure as syndrome decoding
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Stronger security proofs for RSA and rabin bits
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Interactive bi-proof systems and undeniable signature schemes
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A construction for one way hash functions and pseudorandom bit generators
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Uniform results in polynomial-time security
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Universal hash functions & hard core bits
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Pseudorandom function tribe ensembles based on one-way permutations: improvements and applications
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Dial C for cipher: le chiffrement était presque parfait
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Does privacy require true randomness?
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Obfuscation for cryptographic purposes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Towards a separation of semantic and CCA security for public key encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simulation in quasi-polynomial time, and its application to protocol composition
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Nearly one-sided tests and the Goldreich-Levin predicate
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Cryptography with constant input locality
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Magnifying computing gaps: establishing encrypted communication over unidirectional channels
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The twin Diffie-Hellman problem and applications
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Obfuscating point functions with multibit output
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
A brief history of provably-secure public-key encryption
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Basing weak public-key cryptography on strong one-way functions
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
On the round complexity of covert computation
Proceedings of the forty-second ACM symposium on Theory of computing
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Efficiency improvements in constructing pseudorandom generators from one-way functions
Proceedings of the forty-second ACM symposium on Theory of computing
Quantum entropic security and approximate quantum encryption
IEEE Transactions on Information Theory
Circular and leakage resilient public-key encryption under subgroup indistinguishability
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Efficient chosen-ciphertext security via extractable hash proofs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Time space tradeoffs for attacks against one-way functions and PRGs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Algorithms and theory of computation handbook
ProvSec'10 Proceedings of the 4th international conference on Provable security
ISC'10 Proceedings of the 13th international conference on Information security
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
SIAM Journal on Computing
Chosen-Ciphertext Security via Correlated Products
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Chosen ciphertext secure encryption under factoring assumption revisited
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Some recent results on local testing of sparse linear codes
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Limits on the stretch of non-adaptive constructions of pseudo-random generators
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
Threshold and revocation cryptosystems via extractable hash proofs
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On constructing 1-1 one-way functions
Studies in complexity and cryptography
Three XOR-lemmas - an exposition
Studies in complexity and cryptography
Studies in complexity and cryptography
Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
Studies in complexity and cryptography
On security preserving reductions - revised terminology
Studies in complexity and cryptography
Provably secure key assignment schemes from factoring
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Efficient CCA-secure CDH based KEM balanced between ciphertext and key
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Leftover Hash Lemma, revisited
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Better security for deterministic public-key encryption: the auxiliary-input setting
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
List decodability at small radii
Designs, Codes and Cryptography
Toward compact public key encryption based on CDH assumption via extended twin DH assumption
ProvSec'11 Proceedings of the 5th international conference on Provable security
On noise-tolerant learning of sparse parities and related problems
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Cryptography in constant parallel time
Cryptography in constant parallel time
List Decoding Tensor Products and Interleaved Codes
SIAM Journal on Computing
List decoding subspace codes from insertions and deletions
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
Quantum hardcore functions by complexity-theoretical quantum list decoding
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
Bounds on the efficiency of “black-box” commitment schemes
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Can dynamic neural filters produce pseudo-random sequences?
ICANN'05 Proceedings of the 15th international conference on Artificial Neural Networks: biological Inspirations - Volume Part I
On related-secret pseudorandomness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On non-interactive zero-knowledge proofs of knowledge in the shared random string model
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On attribute efficient and non-adaptive learning of parities and DNF expressions
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Hard bits of the discrete log with applications to password authentication
CT-RSA'05 Proceedings of the 2005 international conference on Topics 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
Simple and efficient public-key encryption from computational diffie-hellman in the standard model
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Chosen-Ciphertext security from slightly lossy trapdoor functions
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Bounded key-dependent message security
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Constructing verifiable random functions with large input spaces
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Adaptive trapdoor functions and chosen-ciphertext security
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Local decoding and testing for homomorphisms
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Worst-case vs. algorithmic average-case complexity in the polynomial-time hierarchy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On the power of the randomized iterate
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
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
Perfect non-interactive zero knowledge for NP
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
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
The cryptographic power of random selection
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
A new pseudorandom generator from collision-resistant hash functions
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Plaintext-Checkable encryption
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Self-correctors for cryptographic modules
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Nearly optimal sparse fourier transform
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
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
Simulating quantum computers with probabilistic methods
Quantum Information & Computation
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A short redactable signature scheme using pairing
Security and Communication Networks
Journal of Computer and System Sciences
A code-based 1-out-of-n oblivious transfer based on mceliece assumptions
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
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
Communication efficient shuffle for mental poker protocols
Information Sciences: an International Journal
On the Power of the Randomized Iterate
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
Extended-DDH and lossy trapdoor functions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Identity-based extractable hash proofs and their applications
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Improving the performance of the SYND stream cipher
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
CCA secure IB-KEM from the computational bilinear diffie-hellman assumption in the standard model
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
On the concept of software obfuscation in computer security
ISC'07 Proceedings of the 10th international conference on Information Security
Improved tradeoff between encapsulation and decapsulation of HK09
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
The k-BDH assumption family: bilinear map cryptography from progressively weaker assumptions
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
Cryptanalysis of the Stream Cipher LEX
Designs, Codes and Cryptography
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
Proceedings of the 32nd symposium on Principles of database systems
Witness encryption and its applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
How to keep a secret: leakage deterring public-key cryptosystems
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Clustering in the boolean hypercube in a list decoding regime
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Testing linear-invariant function isomorphism
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
Publicly verifiable ciphertexts
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.06 |
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core” predicates b of functions (permutations) ƒ, discovered in [Blum Micali 82]. Such b(x) cannot be efficiently guessed (substantially better than 50-50) given only ƒ(x). Both b, ƒ are computable in polynomial time.[Yao 82] transforms any one-way function ƒ into a more complicated one, ƒ*, which has a hard-core predicate. The construction applies the original ƒ to many small pieces of the input to ƒ* just to get one “hard-core” bit. The security of this bit may be smaller than any constant positive power of the security of ƒ. In fact, for inputs (to ƒ*) of practical size, the pieces effected by ƒ are so small that ƒ can be inverted (and the “hard-core” bit computed) by exhaustive search.In this paper we show that every one-way function, padded to the form ƒ(p, x) = (p, g(x)), ‖‖p‖‖ = ‖x‖, has by itself a hard-core predicate of the same (within a polynomial) security. Namely, we prove a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors p, x is a hard-core of every one-way function ƒ(p, x) = (p, g(x)). The result extends to multiple (up to the logarithm of security) such bits and to any distribution on the x's for which ƒ is hard to invert.