Efficient and secure pseudo-random number generation
Proceedings of CRYPTO 84 on Advances in cryptology
A fast pseudo random permutation generator with applications to cryptology
Proceedings of CRYPTO 84 on Advances in cryptology
On the cryptographic applications of random functions
Proceedings of CRYPTO 84 on Advances in cryptology
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
RSA/Rabin least significant bits are 1-2- + 1/poly(log N) secure
Proceedings of CRYPTO 84 on Advances in cryptology
Simultaneous security of bits in the discrete log
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Using algorithms as keys in stream ciphers
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
RSA-bits are 0.5 + &egr; secure
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A pseudo-random bit generator based on elliptic logarithms
Proceedings on Advances in cryptology---CRYPTO '86
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
Cryptographic capsules: a disjunctive primitive for interactive protocols
Proceedings on Advances in cryptology---CRYPTO '86
The notion of security for probabilistic cryptosystems
Proceedings on Advances in cryptology---CRYPTO '86
Towards a theory of software protection
Proceedings on Advances in cryptology---CRYPTO '86
On the construction of a random number generator and random function generators
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A new probabilistic encryption scheme
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Limits on the provable consequences of one-way permutations (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
A perfect zero-knowledge proof for a problem equivalent to discrete logarithm
CRYPTO '88 Proceedings on Advances in cryptology
On the existence of pseudorandom generators
CRYPTO '88 Proceedings on Advances in cryptology
Efficient, perfect random number generators
CRYPTO '88 Proceedings on Advances in cryptology
How to sign given any trapdoor function
CRYPTO '88 Proceedings on Advances in cryptology
Proving security against chosen cyphertext attacks
CRYPTO '88 Proceedings on Advances in cryptology
Non-interactive zero-knowledge with preprocessing
CRYPTO '88 Proceedings on Advances in cryptology
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
A universal problem in secure and verifiable distributed computation
CRYPTO '88 Proceedings on Advances in cryptology
On the power of 1-way functions
CRYPTO '88 Proceedings on Advances in cryptology
How to construct pseudorandom permutations from single pseudorandom functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the design of provably-secure cryptographic hash functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Perfect local randomness in pseudo-random sequences
CRYPTO '89 Proceedings on Advances in cryptology
Sparse pseudorandom distributions (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
Bit commitment using pseudo-randomness (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
How to predict congruential generators
CRYPTO '89 Proceedings on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
Disposable zero-knowledge authentications and their applications to untraceable electronic cash
CRYPTO '89 Proceedings on Advances in cryptology
Controlled gradual disclosure schemes for random bits and their applications
CRYPTO '89 Proceedings on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Journal of Computer and System Sciences
Non-interactive and non-malleable commitment
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
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
On Pseudorandom Generators in NC
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Formal Eavesdropping and Its Computational Interpretation
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Elliptic Curve Pseudorandom Sequence Generators
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Cryptographically Sound and Machine-Assisted Verification of Security Protocols
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
One-Time Tables for Two-Party Computation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Compressing Cryptographic Resources
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
An Improved Pseudo-random Generator Based on Discrete Log
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
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
Universally Composable Commitments
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
Session-Key Generation Using Human Passwords Only
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Parallel Pseudo-Random Number Generation
CRYPTO '85 Advances in Cryptology
Symmetric Public-Key Encryption
CRYPTO '85 Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Adi Shamir: On the Universality of the Next Bit Test
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Structural Properties of One-way Hash Functions
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
How to Time-Stamp a Digital Document
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Functional Inversion and Communication Complexity
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The Use of Interaction in Public Cryptosystems (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Necessary and Sufficient Conditions For Collision-Free Hashing
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Pubic Randomness in Cryptography
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Entity Authentication and Key Distribution
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Cryptographic Randomness from Air Turbulence in Disk Drives
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Randomnesss-Rounds Tradeoff in Private Computation
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
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
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
A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
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
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
A Practice-Oriented Treatment of Pseudorandom Number Generators
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Adaptively Secure Oblivious Transfer
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
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
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
ASIACRYPT '02 Proceedings of the 8th 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
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Practice-Oriented Provable Security
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Probabilistic Polynomial-Time Equivalence and Security Analysis
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
High-Speed Pseudorandom Number Generation with Small Memory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
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
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
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
Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Cryptographic Primitives Based on Hard Learning Problems
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
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
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Secrecy types for a simulatable cryptographic library
Proceedings of the 12th ACM conference on Computer and communications security
Cryptography with constant computational overhead
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
Secret linear congruential generators are not cryptographically secure
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Interactive proof systems: Provers that never fail and random selection
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
Portably solving file races with hardness amplification
ACM Transactions on Storage (TOS)
Session Key Reuse Scheme to Improve Routing Efficiency in AnonDSR
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
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
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
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
Limitations of Hardness vs. Randomness under Uniform Reductions
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
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Optimal communication complexity of generic multicast key distribution
IEEE/ACM Transactions on Networking (TON)
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
The uniform hardcore lemma via approximate Bregman projections
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Universally Composable RFID Identification and Authentication Protocols
ACM Transactions on Information and System Security (TISSEC)
Proofs of Retrievability via Hardness Amplification
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Security Amplification for Interactive Cryptographic Primitives
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Chosen-Ciphertext Security via Correlated Products
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
Towards a Theory of Extractable Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On Formal Verification of Arithmetic-Based Cryptographic Primitives
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
New direct-product testers and 2-query PCPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
Preserving Privacy versus Data Retention
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A new hardware efficient stream cipher based on hash functions
International Journal of Communication Networks and Distributed Systems
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
Extractors Using Hardness Amplification
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
General Pseudo-random Generators from Weaker Models of Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
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
On the existence of secure feedback registers
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'96 Proceedings of the 15th 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
Round-optimal zero-knowledge arguments based on any one-way function
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
On the use of interconnection networks in cryptography
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
Randomized authentication systems
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A construction for super pseudorandom permutations from a single pseudorandom function
EUROCRYPT'92 Proceedings of the 11th 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
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Secure bit commitment function against divertibility
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Local randomness in candidate one-way functions
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
Efficient communication-storage tradeoffs for multicast encryption
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
Obfuscation for cryptographic purposes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Security in business process engineering
BPM'03 Proceedings of the 2003 international conference on Business process management
Nearly one-sided tests and the Goldreich-Levin predicate
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
An improved pseudorandom generator based on hardness of factoring
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Forward-security in private-key cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Intrusion-resilient public-key encryption
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Security-amplifying combiners for collision-resistant hash functions
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Amplifying collision resistance: a complexity-theoretic treatment
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Chernoff-type direct product theorems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On simulatability soundness and mapping soundness of symbolic cryptography
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Application of dependency graphs to security protocol analysis
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
Saving private randomness in one-way functions and pseudorandom generators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Degradation and amplification of computational hardness
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A simplified anonymous dynamic source routing protocol for ad-hoc networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Typically-correct derandomization
ACM SIGACT News
Worry-free encryption: functional encryption with public keys
Proceedings of the 17th ACM conference on Computer and communications security
The complexity of explicit constructions
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Securing computation against continuous leakage
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Pseudorandom sequences and stream ciphers
Algorithms and theory of computation handbook
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Constructive proofs of concentration bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Two-source extractors secure against quantum adversaries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Hardness amplification within NP against deterministic algorithms
Journal of Computer and System Sciences
Cryptographic transformations of non-shannon sources of information
Cybernetics and Systems Analysis
Shrinking the keys of discrete-log-type lossy trapdoor functions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Patterns hidden from simple algorithms: technical perspective
Communications of the ACM
A calculus for game-based security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
On the Implementation of Huge Random Objects
SIAM Journal on Computing
Chosen-Ciphertext Security via Correlated Products
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
Implementing cryptographic primitives in the symbolic model
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Input locality and hardness amplification
TCC'11 Proceedings of the 8th conference on Theory of cryptography
General hardness amplification of predicates and puzzles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
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
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
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
Randomly encoding functions: a new cryptographic paradigm
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Some notions of entropy for cryptography
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
On the security of the Winternitz one-time signature scheme
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Studies in complexity and cryptography
Three XOR-lemmas - an exposition
Studies in complexity and cryptography
Studies in complexity and cryptography
Studies in complexity and cryptography
On security preserving reductions - revised terminology
Studies in complexity and cryptography
Another motivation for reducing the randomness complexity of algorithms
Studies in complexity and cryptography
Hard functions for low-degree polynomials over prime fields
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Computational randomness from generalized hardcore sets
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Immunity and pseudorandomness of context-free languages
Theoretical Computer Science
Extracting and verifying cryptographic models from C protocol code by symbolic execution
Proceedings of the 18th ACM conference on Computer and communications security
A note on Yao's theorem about pseudo-random generators
Cryptography and Communications
Cryptography in constant parallel time
Cryptography in constant parallel time
Computational soundness about formal encryption in the presence of secret shares and key cycles
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Non-interactive opening for ciphertexts encrypted by shared keys
ICICS'11 Proceedings of the 13th international conference on Information and communications security
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Another look at “provable security”. II
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Some results on average-case hardness within the polynomial hierarchy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
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
A secure on-demand routing with distributed authentication for trust-based ad hoc networks
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
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
On the possibility of non-invertible watermarking schemes
IH'04 Proceedings of the 6th international conference on Information Hiding
On the role definitions in and beyond cryptography
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
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
An efficient parallel repetition theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
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
Justifying a dolev-yao model under active attacks
Foundations of Security Analysis and Design III
Hardness amplification of weakly verifiable puzzles
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On hardness amplification of one-way functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Analysis of random oracle instantiation scenarios for OAEP and other practical schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
A type system for computationally secure information flow
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computational indistinguishability between quantum states and its cryptographic application
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Limits of the cryptographic realization of dolev-yao-style XOR
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Towards a theory of intrusion detection
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Quantifying probabilistic information flow in computational reactive systems
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
A public key cryptosystem based on three new provable problems
Theoretical Computer Science
Limits of the BRSIM/UC soundness of dolev-yao models with hashes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Conditional reactive simulatability
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Adaptive trapdoor functions and chosen-ciphertext security
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Cryptanalysis of the energy efficient stream ciphers SSC2
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Formal methods and cryptography
FM'06 Proceedings of the 14th international conference on Formal Methods
On pseudorandom generators with linear stretch in NC0
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
On the power of the randomized iterate
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Concurrent zero-knowledge with timing, revisited
Theoretical Computer Science
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
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
The security of triple encryption and a framework for code-based game-playing proofs
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
Concrete security of the blum-blum-shub pseudorandom generator
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
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
Hardness amplification via space-efficient direct products
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
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
Multiparty computation secure against continual memory leakage
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hardness preserving constructions of pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Counterexamples to hardness amplification beyond negligible
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Certifying assembly with formal security proofs: The case of BBS
Science of Computer Programming
An information-theoretic model of voting systems
Mathematical and Computer Modelling: An International Journal
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
The Complexity of Distributions
SIAM Journal on Computing
On the Power of the Randomized Iterate
SIAM Journal on Computing
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
Impossibility results on weakly black-box hardness amplification
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the security of IV dependent stream ciphers
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
On the complexity of hard-core set constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Pseudorandom generators based on subcovers for finite groups
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
Private yoking proofs: attacks, models and new provable constructions
RFIDSec'12 Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues
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
A cookbook for black-box separations and a recipe for UOWHFs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Efficient, secure, private distance bounding without key updates
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hard Functions for Low-Degree Polynomials over Prime Fields
ACM Transactions on Computation Theory (TOCT)
Splittable pseudorandom number generators using cryptographic hashing
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Towards a secure human-and-computer mutual authentication protocol
AISC '12 Proceedings of the Tenth Australasian Information Security Conference - Volume 125
Analysis and improvement of lindell's UC-secure commitment schemes
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Robust pseudorandom generators
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
| Hi-index | 0.02 |
The purpose of this paper is to introduce a new information theory and explore its appplications. Using modern computational complexity, we study the notion of information that can be accessed through a feasible computation. In Part 1 of this paper, we lay the foundation of the theory and set up a framework for cryptography and pseudorandom number generation. In Part 2, we study the concept of trapdoor functions and examine applications of such functions in cryptography, pseudorandom number generation, and abstract complexity theory.