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
Uses of randomness in algorithms and protocols
Uses of randomness in algorithms and protocols
Verifiable disclose for secrets and applications (abstract)
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Complexity and security of distributed protocols
Complexity and security of distributed protocols
Linear-time encodable and decodable error-correcting codes
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Equivalence Between Two Flavours of Oblivious Transfers
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
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Bit Commitment Using Pseudo-Randomness
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A quantum bit commitment scheme provably unbreakable by both parties
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Reducibility and completeness in multi-party private computations
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On the complexity of bounded-interaction and noninteractive zero-knowledge proofs
SFCS '94 Proceedings of the 35th 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
25 years of quantum cryptography
ACM SIGACT News
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
One-Time Tables for Two-Party Computation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Optimistic Fair Secure Computation
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Generation of Shared RSA Keys by Two Parties
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient Oblivious Transfer in the Bounded-Storage Model
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
The Search for the Holy Grail in Quantum Cryptography
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
How to Break a Semi-anonymous Fingerprinting Scheme
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Anonymous Fingerprinting Based on Committed Oblivious Transfer
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Efficient Two-Party Secure Computation on Committed Inputs
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Composable Security in the Bounded-Quantum-Storage Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Single Initialization Server for Multi-party Cryptography
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Statistical Security Conditions for Two-Party Secure Function Evaluation
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Oblivious Transfer Based on the McEliece Assumptions
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Founding Cryptography on Oblivious Transfer --- Efficiently
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Voting with unconditional privacy by merging Prêt à voter and PunchScan
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
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
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A two-server, sealed-bid auction protocol
FC'02 Proceedings of the 6th international conference on Financial cryptography
OT-combiners via secure computation
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Oblivious transfer based on physical unclonable functions
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
The IPS compiler: optimizations, variants and concrete efficiency
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
A weakness in some oblivious transfer and zero-knowledge protocols
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
General public key m-out-of-n oblivious transfer
CIS'04 Proceedings of the First international conference on Computational and Information Science
IH'04 Proceedings of the 6th international conference on Information Hiding
Multi-party computation with conversion of secret sharing
Designs, Codes and Cryptography
On the impossibility of non-static quantum bit commitment between two parties
Quantum Information Processing
On the feasibility of consistent computations
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Towards Trustworthy Elections
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
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
Universally composable oblivious transfer from lossy encryption and the mceliece assumptions
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Statistically secure linear-rate dimension extension for oblivious affine function evaluation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Efficient committed oblivious transfer of bit strings
ISC'07 Proceedings of the 10th international conference on Information Security
Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
In this paper we present an efficient protocol for "Committed Oblivious Transfer" to perform oblivious transfer on committed bits: suppose Alice is committed to bits a0 and a1 and Bob is committed to b, they both want Bob to learn and commit to ab without Alice learning b nor Bob learning ab. Our protocol, based on the properties of error correcting codes, uses Bit Commitment (BC) and one-out-of-two Oblivious Transfer (OT) as black boxes. Consequently the protocol may be implemented with or without a computational assumption, depending on the kind of BC and OT used by the participants. Assuming a Broadcast Channel is also available, we exploit this result to obtain a protocol for Private Multi-Party Computation, without making assumptions about a specific number or fraction of participants being honest. We analyze the protocol's efficiency in terms of BCs and OTs performed. Our approach connects Zero Knowledge proofs on BCs, Oblivious Circuit Evaluation and Private Multi-Party Computations in a conceptually simple and efficient way.