A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Practical Quantum Oblivious Transfer
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
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A study of statistical zero-knowledge proofs
A study of statistical zero-knowledge proofs
Completeness in two-party secure computation: a computational view
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
ACM SIGACT News - A special issue on cryptography
Key agreement from weak bit agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Oblivious transfers and privacy amplification
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Robuster combiners for oblivious transfer
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient unconditional oblivious transfer from almost any noisy channel
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
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
On the power of the randomized iterate
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Information-Theoretic conditions for two-party secure function evaluation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Error-Tolerant Combiners for Oblivious Primitives
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Composable Security in the Bounded-Quantum-Storage Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Oblivious Transfer from Weak Noisy Channels
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
General hardness amplification of predicates and puzzles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Unconditional and composable security using a single stateful tamper-proof hardware token
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Concurrent composition in the bounded quantum storage model
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
Building oblivious transfer on channel delays
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Secure two-party computation over a Z-channel
ProvSec'11 Proceedings of the 5th international conference on Provable security
On the efficiency of bit commitment reductions
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A parallel repetition theorem for leakage resilience
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
| Hi-index | 0.00 |
Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, OT cannot be achieved in an unconditionally secure way for both parties from scratch. Therefore, it is a natural question what information-theoretic primitives or computational assumptions OT canbe based on.The results in our paper are threefold. First, we give an optimal proof for the standard protocol to realize unconditionally secure OT from a weak variant of OT called universal OT, for which a malicious receiver can virtually obtain any possible information he wants, as long as he does not get all the information. This result is based on a novel distributed leftover hash lemma which is of independent interest.Second, we give conditions for when OT can be obtained from a faulty variant of OT called weak OT, for which it can occur that any of the parties obtains too much information, or the result is incorrect. These bounds and protocols, which correct on previous results by Damgård et. al., are of central interest since in most known realizations of OT from weak primitives, such as noisy channels, a weak OT is constructed first.Finally, we carry over our results to the computational setting and show how a weak OT that is sometimes incorrect and is only mildly secure against computationally bounded adversaries can be strengthened.