Generalized oblivious transfer by secret sharing
Generalized Oblivious Transfer (GOT) was introduced by \textit{Y. Ishai} and \textit{E. Kushilevitz} [``Private simultaneous messages protocols with applications, in: Proc. 5th Israel symposium on theory of computing and systems, ISTCS97. Los Alamitos, CA: IEEE Computer Society. 174--184 (1997)]. A set of messages \(U\) and a decreasing monotone collection of ``permissible subsets is given, i.e., every subset of a permissible set is also permissible. The objective is to allow to choose any of the subsets by one party without taking knowledge of the other subsets and leaving the other party oblivious about the choice. The author constructs a monotone increasing access structure from the collection of permissible sets for a secret-sharing scheme. In combination with a \(k\)-out-of-\(n\)-OT he obtains his GOT-protocol. The author compares his scheme with another GOT-protocol recently introduced in [\textit{B. Shankar, K. Srinathan} and \textit{C. P. Rangan}, Lect. Notes Comput. Sci. 4904, 304--309 (2008; Zbl 1131.68336)]. The author shows a duality relation between his access structure and the one used by Shankar et al. Finally, he considers two applications, namely priced-OT and oblivious multivariate polynomial evaluation. Two concrete examples show that in some cases his access structure is ideal whereas in others the access structure of Shankar is ideal.
- Alternative Protocols for Generalized Oblivious Transfer
- Computational and Information Science
- scientific article; zbMATH DE number 2127887
- scientific article; zbMATH DE number 1952770
- Computationally secure oblivious transfer
- Quantum m-out-of-n oblivious transfer
- A new efficient protocol for k-out-of-n oblivious transfer
- Comments on the `m out of n oblivious transfer'
- Oblivious transfer and polynomial evaluation
- Alternative Protocols for Generalized Oblivious Transfer
- Characterizing Ideal Weighted Threshold Secret Sharing
- Computationally secure oblivious transfer
- Hierarchical threshold secret sharing
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 4123667 (Why is no real title available?)
- Oblivious Polynomial Evaluation
- Oblivious transfers and intersecting codes
- On the Optimization of Bipartite Secret Sharing Schemes
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
- A group identification protocol with leakage resilience of secret sharing scheme
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Secret sharing schemes for dense forbidden graphs
- Secret-sharing schemes for very dense graphs
- Generalizing efficient multiparty computation
- Secret-Sharing Schemes: A Survey
- scientific article; zbMATH DE number 708832 (Why is no real title available?)
- 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
- Alternative Protocols for Generalized Oblivious Transfer
- Computational and Information Science
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Ideal uniform multipartite secret sharing schemes
- Restricted adaptive oblivious transfer
- Distributed protocols for oblivious transfer and polynomial evaluation
- Secret sharing, slice formulas, and monotone real circuits
This page was built for publication: Generalized oblivious transfer by secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629875)
