Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations

Anderson C. A. Nascimento, Joern Mueller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai

Published Jan 1, 2003• 8 citations
Publisher
DOI
10.1007/10958513_12

Related papers

Unconditionally secure homomorphic pre-distributed commitments

Anderson C. A. Nascimento, Joern Mueller-Quade, Akira Otsuka +1 more

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•2 citations

Universally Composable Committed Oblivious Transfer With A Trusted Initializer

Adriana C. B. Pinto, Bernardo David, Jeroen van de Graaf +1 more

Committed Oblivious Transfer (COT) is a two-party primitive that combines one-out-of-two oblivious transfer with bit commitment. In the beginning of COT, a sender is committed to bits b0, b1 and a receiver to a choice bit c. In the end, the receiver is committed to bc without learning anything about b1-c, while the sender learns nothing about c. This primitive implies secure multi-party computation assuming that a broadcast channel is available. In this paper, we introduce the first universally composable unconditionally secure committed oblivious transfer protocol based on a Trusted Initializer (TI), which pre-distributes data to the parties. Our protocol builds on simple bit commitment and oblivious transfer protocols, using XOR commitments to prove simple relations in zero-knowledge. Besides providing very high security guarantees, our protocols are significantly simpler and more efficient than previous results, since they rely on pre-computed operations distributed by the TI.

Simpósio Brasileiro de Cibersegurança (SBSeg)•Nov 19, 2012•0 citations

Efficient Two-Party Secure Computation on Committed Inputs

Stanisław Jarecki, Vitaly Shmatikov

Lecture notes in computer science•Jan 1, 2007•163 citations

Bit Commitment from Non-Local Correlations

Severin Winkler, Stefan Wolf, Juerg Wullschleger

Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission, and show that they can be used for realizing unconditionally secure bit commitment as soon as they are non-trivial, i.e., cannot be realized from distributed randomness only. In particular, our result implies that any twoqubit state without hidden-variable model has an input-output behavior allowing for unconditional bit commitment.

•Nov 21, 2008•1 citation

Bit Commitment From Nonsignaling Correlations

Severin Winkler, Jürg Wullschleger, Stefan Wolf

Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission and show that they can be used for realizing unconditionally secure bit commitment as soon as they are nontrivial, i.e., cannot be securely realized from distributed randomness only.

arXiv:0811.3589•IEEE Transactions on Information Theory•Feb 18, 2011•3 citations

Engineering Secure Two-Party Computation Protocols

Thomas H. Schneider

Springer eBooks•Jan 1, 2012•12 citations
Committed Oblivious Transfer (COT) is a two-party primitive that combines one-out-of-two oblivious transfer with bit commitment. In the beginning of COT, a sender is committed to bits b0, b1 and a receiver to a choice bit c. In the end, the receiver is committed to bc without learning anything about b1-c, while the sender learns nothing about c. This primitive implies secure multi-party computation assuming that a broadcast channel is available. In this paper, we introduce the first universally composable unconditionally secure committed oblivious transfer protocol based on a Trusted Initializer (TI), which pre-distributes data to the parties. Our protocol builds on simple bit commitment and oblivious transfer protocols, using XOR commitments to prove simple relations in zero-knowledge. Besides providing very high security guarantees, our protocols are significantly simpler and more efficient than previous results, since they rely on pre-computed operations distributed by the TI.
Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission, and show that they can be used for realizing unconditionally secure bit commitment as soon as they are non-trivial, i.e., cannot be realized from distributed randomness only. In particular, our result implies that any twoqubit state without hidden-variable model has an input-output behavior allowing for unconditional bit commitment.
Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission and show that they can be used for realizing unconditionally secure bit commitment as soon as they are nontrivial, i.e., cannot be securely realized from distributed randomness only.