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
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh 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
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
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The All-or-Nothing Nature of Two-Party Secure Computation
CRYPTO '99 Proceedings of the 19th 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
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
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
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
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
Entity Authentication and Key Distribution
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Lower bounds on the efficiency of encryption and digital signature schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Complexity of Online Memory Checking
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Path-quality monitoring in the presence of adversaries
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Zero Knowledge and Soundness Are Symmetric
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Oblivious-Transfer Amplification
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Weak Pseudorandom Functions in Minicrypt
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Worst-Case to Average-Case Reductions Revisited
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The complexity of online memory checking
Journal of the ACM (JACM)
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Bounds on the efficiency of black-box commitment schemes
Theoretical Computer Science
Basing cryptographic protocols on tamper-evident seals
Theoretical Computer Science
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
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Single database private information retrieval implies oblivious transfer
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Protocols and lower bounds for failure localization in the internet
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Basing weak public-key cryptography on strong one-way functions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Degradation and amplification of computational hardness
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A zero-one law for cryptographic complexity with respect to computational UC security
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Relativized worlds without worst-case to average-case reductions for NP
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Trapdoor sanitizable signatures made easy
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
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
On the black-box complexity of optimally-fair coin tossing
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Exploring the limits of common coins using frontier analysis of protocols
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Constant-round non-malleable commitments from any one-way function
Proceedings of the forty-third annual ACM symposium on Theory of computing
Quantum commitments from complexity assumptions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Weak oblivious transfer from strong one-way functions
ProvSec'11 Proceedings of the 5th international conference on Provable security
Cryptography in constant parallel time
Cryptography in constant parallel time
Black-Box Constructions of Protocols for Secure Computation
SIAM Journal on Computing
Bounds on the efficiency of “black-box” commitment schemes
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Basing cryptographic protocols on tamper-evident seals
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On hardness amplification of one-way functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Reducing complexity assumptions for statistically-hiding commitment
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
Universal one-way hash functions via inaccessible entropy
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On the power of the randomized iterate
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Tight bounds for unconditional authentication protocols in the manual channel and shared key models
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Polylogarithmic private approximations and efficient matching
TCC'06 Proceedings of the Third conference on Theory of Cryptography
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Characterizing pseudoentropy and simplifying pseudorandom generator constructions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the Power of the Randomized Iterate
SIAM Journal on Computing
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
ACM Transactions on Computation Theory (TOCT)
Black-box reductions and separations in cryptography
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Shannon impossibility, revisited
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Limits of random oracles in secure computation
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
It is shown that many of the standard cryptographic tasks are equivalent to the usual definition of a one-way function. In particular, it is shown that for some of the standard cryptographic tasks any secure protocol for the task can be converted into a one-way function in the usual sense, and thus the security of any proposed protocol for these tasks is implicitly based on a function being 'one-way.' Thus, the usual definition of a one-way function is robust; any one-way function with respect to another definition on which a secure cryptographic protocol can be based can be used to construct a one-way function in the usual sense. The authors focus on private-key encryption, identification/authentication, bit commitment, and coin flipping by telephone. However, the proof techniques presented here can be easily adopted to prove analogous results for other cryptographic tasks.