Generalized oblivious transfer by secret sharing

DOI10.1007/s10623-010-9378-8zbMath1220.94051OpenAlexW2008001880MaRDI QIDQ629875

Tamir Tassa

Publication date: 10 March 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-010-9378-8

zbMATH Keywords

secret sharingoblivious transfermultiparty computationaccess structuresgeneralized oblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Upslices, downslices, and secret-sharing with complexity of \(1.5^n\), Secret-sharing schemes for very dense graphs, ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls, A group identification protocol with leakage resilience of secret sharing scheme, Generalizing Efficient Multiparty Computation, Actively secure arithmetic computation and VOLE with constant computational overhead, Ideal uniform multipartite secret sharing schemes, Constructing ideal secret sharing schemes based on Chinese remainder theorem, Restricted adaptive oblivious transfer, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Secret-Sharing Schemes: A Survey, A note on ``Selling multiple secrets to a single buyer, Construction of arithmetic secret sharing schemes by using torsion limits, ACE with Compact Ciphertext Size and Decentralized Sanitizers, Secret Sharing Schemes for Dense Forbidden Graphs

Cites Work

• Hierarchical threshold secret sharing
• Computationally secure oblivious transfer
• Oblivious transfers and intersecting codes
• Characterizing Ideal Weighted Threshold Secret Sharing
• On the Optimization of Bipartite Secret Sharing Schemes
• Alternative Protocols for Generalized Oblivious Transfer
• Oblivious Polynomial Evaluation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item