CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
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
Lower bounds on the efficiency of encryption and digital signature schemes
Proceedings of the thirty-fifth 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
Oblivious polynomial evaluation
Journal of Computer Science and Technology
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Oblivious Transfer Based on the McEliece Assumptions
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
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 (Im)Possibility of Key Dependent Encryption
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
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
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Oracle Separation in the Non-uniform Model
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Bounds on the efficiency of black-box commitment schemes
Theoretical Computer Science
Towards a separation of semantic and CCA security for public key encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Does secure time-stamping imply collision-free hash functions?
ProvSec'07 Proceedings of the 1st international conference on Provable security
Basing weak public-key cryptography on strong one-way functions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
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
Trapdoor sanitizable signatures made easy
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Chosen-Ciphertext Security via Correlated Products
SIAM Journal on Computing
On the impossibility of instantiating PSS in the standard model
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Separating succinct non-interactive arguments from all falsifiable assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Key-dependent message security: generic amplification and completeness
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Weak oblivious transfer from strong one-way functions
ProvSec'11 Proceedings of the 5th international conference on Provable security
Black-Box Constructions of Protocols for Secure Computation
SIAM Journal on Computing
Universally composable oblivious transfer in the multi-party setting
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Two is a crowd? a black-box separation of one-wayness and security under correlated inputs
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Public-key cryptographic primitives provably as secure as subset sum
TCC'10 Proceedings of the 7th 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
The relationship between password-authenticated key exchange and other cryptographic primitives
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On the generic insecurity of the full domain hash
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On robust combiners for oblivious transfer and other primitives
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Composition implies adaptive security in minicrypt
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Black-box reductions and separations in cryptography
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Barriers in cryptography with weak, correlated and leaky sources
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of nonuniformity in proofs of security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Completeness for symmetric two-party functionalities - revisited
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
On the feasibility of extending oblivious transfer
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Limits of random oracles in secure computation
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
In this paper we study the relationships among some of the most fundamental primitives and protocols in cryptography: public-key encryption (i.e. trapdoor predicates), oblivious transfer (which is equivalent to general secure multi-party computation), key agreement and trapdoor permutations. Our main results show that public-key encryption and oblivious transfer are incomparable under black-box reductions. These separations are tightly matched by our positive results where a restricted (strong) version of one primitive does imply the other primitive. We also show separations between oblivious transfer and key agreement. Finally, we conclude that neither oblivious transfer nor trapdoor predicates imply trapdoor permutations. Our techniques for showing negative results follow the oracle separations of R. Impagliazzo and S. Rudich (1989).