On The Efficiency of Bit Commitment Reductions (original) (raw)
Related papers
Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations
2006 IEEE International Symposium on Information Theory, 2006
Efficient and Universally Composable Committed Oblivious Transfer and Applications
Lecture Notes in Computer Science, 2004
Committed Oblivious Transfer and Private Multi-Party Computation
Lecture Notes in Computer Science, 1995
Efficient committed oblivious transfer of bit strings
Berry Schoenmakers, Mehmet Sabir Kiraz
Information Security, 2007
Efficient Two-Party Secure Computation on Committed Inputs
Lecture Notes in Computer Science, 2007
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security
Advances in Cryptology – ASIACRYPT 2020, 2020
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
2017
The Price of Low Communication in Secure Multi-party Computation
2017
Lecture Notes in Computer Science, 2009
Proceedings 41st Annual Symposium on Foundations of Computer Science
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer
Efficient Cryptographic Protocols Based on Noisy Channels
Lecture Notes in Computer Science, 1997
Constant-round secure two-party computation from a linear number of oblivious transfer
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
Theory of Cryptography, 2014
Security with Low Communication Overhead
Lecture Notes in Computer Science, 1991
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
Advances in Cryptology – EUROCRYPT 2010, 2010
A Construction for General and Efficient Oblivious Commitment Based Envelope Protocols
Lecture Notes in Computer Science, 2006
Generalizing Efficient Multiparty Computation
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
Lecture Notes in Computer Science, 2012
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences, 2012
Generalized Oblivious Transfer Protocols Based on Noisy Channels
Lecture Notes in Computer Science, 2001
Secure Two-Party Computation over Unreliable Channels
Lecture Notes in Computer Science, 2018
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
Lecture Notes in Computer Science, 2009
Efficient and Non-interactive Non-malleable Commitment
Jonathan Katz, Giovanni Di Crescenzo
Lecture Notes in Computer Science, 2001
Secure Multiparty Computation with Minimal Interaction
2010
Essentially Optimal Universally Composable Oblivious Transfer
Information Security and Cryptology – ICISC 2008, 2009
S.: Efficient unconditional oblivious transfer from almost any noisy channel
2004
An Efficient Secure Oblivious Transfer
Obtaining Efficient Fully Simulatable Oblivious Transfer from General Assumptions
Anais do XXI Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg 2011)
Efficient Unconditional Oblivious Transfer From Almost Any Noisy Channel
Security in Communication Networks, 2005
On Unconditionally Secure Distributed Oblivious Transfer
Journal of Cryptology, 2007
On the Complexity of UC Commitments
Lecture Notes in Computer Science, 2014
A New Approach to Practical Active-Secure Two-Party Computation
Lecture Notes in Computer Science, 2012
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07, 2007
Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems