Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
From MaRDI portal
Publication:1694723
DOI10.1016/j.tcs.2017.12.019zbMath1425.94067OpenAlexW2776085435MaRDI QIDQ1694723
Jianchang Lai, Sha Ma, Fuchun Guo, Rongmao Chen, Yi Mu
Publication date: 6 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.019
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Oblivious keyword search
- Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes
- On Cut-and-Choose Oblivious Transfer and Its Variants
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Improved OT Extension for Transferring Short Secrets
- Amortizing Garbled Circuits
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- A New Approach to Practical Active-Secure Two-Party Computation
- Extending Oblivious Transfer Efficiently
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Generic Fully Simulatable Adaptive Oblivious Transfer
- Private information retrieval
- Membership Encryption and Its Applications
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Advances in Cryptology - CRYPTO 2003
- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Simulatable Adaptive Oblivious Transfer
- Efficient Fully-Simulatable Oblivious Transfer
- Public Key Cryptography - PKC 2005
This page was built for publication: Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
