Efficient committed oblivious transfer of bit strings (original) (raw)
Related papers
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
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
2017
An Efficient Secure Oblivious Transfer
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security
Advances in Cryptology – ASIACRYPT 2020, 2020
Efficient Two-Party Secure Computation on Committed Inputs
Lecture Notes in Computer Science, 2007
Ziya Alper Genç, Mehmet Sabir Kiraz
Weakening Security Assumptions and Oblivious Transfer (Abstract)
International Cryptology Conference, 1988
Proceedings 41st Annual Symposium on Foundations of Computer Science
Protocols for Authenticated Oblivious Transfer
IACR Cryptol. ePrint Arch., 2016
Extending Oblivious Transfers Efficiently
Lecture Notes in Computer Science, 2003
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
Theory of Cryptography, 2014
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
Lecture Notes in Computer Science, 2012
Lecture Notes in Computer Science, 2009
Weakening Security Assumptions and Oblivious Transfer
Lecture Notes in Computer Science
Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
Lecture Notes in Computer Science, 2009
Verifiable Disclosure of Secrets and Applications (Abstract)
Lecture Notes in Computer Science
Efficient oblivious transfers with access control
Computers & Mathematics with Applications, 2012
Quid-Pro-Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution
2012
On The Efficiency of Bit Commitment Reductions
Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997
Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
Lecture Notes in Computer Science, 2006
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
2017
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
Lecture Notes in Computer Science, 2009
Information-Theoretically Secure String Commitments Based on Packet Reordering Channels
IEEE Access
A Construction for General and Efficient Oblivious Commitment Based Envelope Protocols
Lecture Notes in Computer Science, 2006
Efficient computational oblivious transfer using interactive hashing
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security - ASIACCS '11, 2011
Bulletproofs: Short Proofs for Confidential Transactions and More
2018 IEEE Symposium on Security and Privacy (SP), 2018
A New Approach to Practical Active-Secure Two-Party Computation
Lecture Notes in Computer Science, 2012
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Generalized Oblivious Transfer Protocols Based on Noisy Channels
Lecture Notes in Computer Science, 2001
Zero-Knowledge Proofs from Secure Multiparty Computation
SIAM Journal on Computing, 2009