Efficient Oblivious Transfer Protocols Achieving a Non-zero Rate from Any Non-trivial Noisy Correlation (original) (raw)
Related papers
S.: Efficient unconditional oblivious transfer from almost any noisy channel
2004
Efficient Unconditional Oblivious Transfer From Almost Any Noisy Channel
Security in Communication Networks, 2005
Generalized Oblivious Transfer Protocols Based on Noisy Channels
Lecture Notes in Computer Science, 2001
On the Oblivious Transfer Capacity of the Erasure Channel
2006 IEEE International Symposium on Information Theory, 2006
Efficient Cryptographic Protocols Based on Noisy Channels
Lecture Notes in Computer Science, 1997
Weakening Security Assumptions and Oblivious Transfer (Abstract)
International Cryptology Conference, 1988
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
Theory of Cryptography, 2014
An Efficient Secure Oblivious Transfer
Efficient committed oblivious transfer of bit strings
Berry Schoenmakers, Mehmet Sabir Kiraz
Information Security, 2007
Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model
IEEE Transactions on Information Theory, 2011
Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations
2006 IEEE International Symposium on Information Theory, 2006
Weakening Security Assumptions and Oblivious Transfer
Lecture Notes in Computer Science
Error-tolerant oblivious transfer in the noisy-storage model
arXiv (Cornell University), 2023
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)
More extensions of weak oblivious transfer
2006 International Conference onResearch, Innovation and Vision for the Future
Proceedings 41st Annual Symposium on Foundations of Computer Science
Essentially Optimal Universally Composable Oblivious Transfer
Information Security and Cryptology – ICISC 2008, 2009
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
Oblivious transfer with a memory-bounded receiver
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
Achieving oblivious transfer using weakened security assumptions
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences, 2012
Oblivious Transfers and Privacy Amplification
Journal of Cryptology, 2003
Reducing Complexity Assumptions for Oblivious Transfer
2009
Secure Two-Party Computation over Unreliable Channels
Lecture Notes in Computer Science, 2018
Extending Oblivious Transfers Efficiently
Lecture Notes in Computer Science, 2003
Efficient oblivious transfers with access control
Computers & Mathematics with Applications, 2012
On the Reversibility of Oblivious Transfer
Lecture Notes in Computer Science, 1991
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
IACR Cryptol. ePrint Arch., 2017