Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
type: Item
instance of: scholarly article
title: Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
zbMATH Open document ID: 1425.94067
author: Jianchang Lai
author: Yi Mu
author: Fuchun Guo
author: Rongmao Chen
author: Sha Ma
published in: Theoretical Computer Science
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6834953
zbMATH Keywords: oblivious transfer
zbMATH Keywords: privacy
zbMATH Keywords: minimum communication cost
zbMATH Keywords: encryption
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.12.019
OpenAlex ID: W2776085435
cites work: More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext
cites work: Simulatable Adaptive Oblivious Transfer
cites work: Private information retrieval
cites work: Q3518415
cites work: Public Key Cryptography - PKC 2005
cites work: Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
cites work: Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
cites work: Q3787498
cites work: Blind Identity-Based Encryption and Simulatable Oblivious Transfer
cites work: Membership Encryption and Its Applications
cites work: Amortizing Garbled Circuits
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Improved OT Extension for Transferring Short Secrets
cites work: On Cut-and-Choose Oblivious Transfer and Its Variants
cites work: Generic Fully Simulatable Adaptive Oblivious Transfer
cites work: Extending Oblivious Transfer Efficiently
cites work: Efficient Fully-Simulatable Oblivious Transfer
cites work: Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
cites work: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
cites work: Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
cites work: Q4412995
cites work: Q4941880
cites work: Efficient oblivious transfer protocols
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Oblivious keyword search
cites work: Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes
DOI: 10.1016/J.TCS.2017.12.019
description: scientific article; zbMATH DE number 6834953