Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
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
Key management for encrypted broadcast
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A practical secure physical random bit generator
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
One-way functions are essential for single-server private information retrieval
STOC '99 Proceedings of the thirty-first 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
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A formal treatment of remotely keyed encryption
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Public-key cryptography and password protocols: the multi-user case
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Pseudo-random functions and factoring (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
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Funkspiel schemes: an alternative to conventional tamper resistance
Proceedings of the 7th ACM conference on Computer and communications security
Key management for encrypted broadcast
ACM Transactions on Information and System Security (TISSEC)
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
An optimally robust hybrid mix network
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Guaranteeing the diversity of number generators
Information and Computation
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Ciphers with Arbitrary Finite Domains
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Spectral Bounds on General Hard Core Predicates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Compressing Cryptographic Resources
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Towards Sound Approaches to Counteract Power-Analysis Attacks
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Security Protocols and Specifications
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Pubic Randomness in Cryptography
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Indistinguishability of Random Systems
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Informatics - 10 Years Back. 10 Years Ahead.
Trustee Tokens: Simple and Practical Anonymous Digital Coin Tracing
FC '99 Proceedings of the Third International Conference on Financial Cryptography
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Efficient State Updates for Key Management
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Accelerated Remotely Keyed Encruption
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
High-Speed Pseudorandom Number Generation with Small Memory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Incremental Unforgeable Encryption
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Adaptive Security for the Additive-Sharing Based Proactive RSA
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A PVSS as Hard as Discrete Log and Shareholder Separability
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On Sufficient Randomness for Secure Public-Key Cryptosystems
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Monte-Carlo Integration Using Cryptographically Secure Pseudo-random Generator
NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
Encryption Modes with Almost Free Message Integrity
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Power analysis: attacks and countermeasures
Programming methodology
Cryptographic techniques for privacy-preserving data mining
ACM SIGKDD Explorations Newsletter
Robust numerical integration and pairwise independent random variables
Journal of Computational and Applied Mathematics
Dynamic random Weyl sampling for drastic reduction of randomness in Monte Carlo integration
Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
ACM Transactions on Embedded Computing Systems (TECS)
Cryptography and mechanism design
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
A note on quadratic residuosity and UP
Information Processing Letters
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Privacy-preserving collaborative association rule mining
Journal of Network and Computer Applications
Data currency in replicated DHTs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A future-adaptive password scheme
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
On analysis and synthesis of (n, k)-non-linear feedback shift registers
Proceedings of the conference on Design, automation and test in Europe
Extractors for binary elliptic curves
Designs, Codes and Cryptography
The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
OAEP Is Secure under Key-Dependent Messages
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Robust random number generation for peer-to-peer systems
Theoretical Computer Science
Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs
Information Security and Cryptology
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
Proceedings of the 16th ACM conference on Computer and communications security
One-wayness equivalent to general factoring
IEEE Transactions on Information Theory
A note on quadratic residuosity and UP
Information Processing Letters
A transformation from the Fibonacci to the Galois NLFSRs
IEEE Transactions on Information Theory
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Smooth entropy and Rényi entropy
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Using hash functions as a hedge against chosen ciphertext attack
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Perfectly concealing quantum bit commitment from any quantum one-way permutation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
An elliptic curve backdoor algorithm for RSASSA
IH'06 Proceedings of the 8th international conference on Information hiding
Backdoor attacks on black-box ciphers exploiting low-entropy plaintexts
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Efficient pseudorandom generators based on the DDH assumption
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A security analysis of the NIST SP 800-90 elliptic curve random number generator
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Extractors for Jacobian of hyperelliptic curves of genus 2 in odd characteristic
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Space-efficient kleptography without random oracles
IH'07 Proceedings of the 9th international conference on Information hiding
A proof of security in O(2n) for the Benes scheme
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
A linear lower bound on the communication complexity of single-server private information retrieval
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A security framework for privacy-preserving data aggregation in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Optimally tight security proofs for hash-then-publish time-stamping
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
On security preserving reductions - revised terminology
Studies in complexity and cryptography
Best effort and practice activation codes
TrustBus'11 Proceedings of the 8th international conference on Trust, privacy and security in digital business
A note on Yao's theorem about pseudo-random generators
Cryptography and Communications
A subliminal channel in secret block ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Asynchronous perfectly secure communication over one-time pads
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Randomized quicksort and the entropy of the random source
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Privacy-Preserving collaborative association rule mining
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
On hardness amplification of one-way functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Public-key steganography with active attacks
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Universally composable time-stamping schemes with audit
ISC'05 Proceedings of the 8th international conference on Information Security
Information theory and the security of binary data perturbation
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Collusion-Resistant protocol for privacy-preserving distributed association rules mining
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
PRF domain extension using DAGs
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Parallelizable authentication trees
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Benes and butterfly schemes revisited
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
From non-adaptive to adaptive pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Hardness preserving constructions of pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Contextual OTP: mitigating emerging man-in-the-middle attacks with wireless hardware tokens
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
On the privacy of concealed data aggregation
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Hardness preserving reductions via cuckoo hashing
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
SybilCast: broadcast on the open airwaves (extended abstract)
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.12 |
From the Publisher:A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.