A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Proceedings on Advances in cryptology---CRYPTO '86
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-interactive oblivious transfer and applications
CRYPTO '89 Proceedings on Advances in cryptology
Elements of information theory
Elements of information theory
An explication of secret sharing schemes
Designs, Codes and Cryptography
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Universal service-providers for database private information retrieval (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes
Designs, Codes and Cryptography
Generalized Zig-zag Functions and Oblivious Transfer Reductions
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On the Size of Shares for Secret Sharing Schemes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Distributed Oblivious Transfer
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The relationship between public key encryption and oblivious transfer
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
ACM SIGACT News - A special issue on cryptography
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Lower bounds for oblivious transfer reductions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory - Part 1
On Unconditionally Secure Distributed Oblivious Transfer
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Strengthening the Security of Distributed Oblivious Transfer
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
A verifiable distributed oblivious transfer protocol
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Scalar product-based distributed oblivious transfer
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Information-Theoretic conditions for two-party secure function evaluation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
T-out-of-n distributed oblivious transfer protocols in non-adaptive and adaptive settings
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
An information-theoretically secure threshold distributed oblivious transfer protocol
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Hi-index | 0.00 |
This paper is about the Oblivious Transfer in the distributed model recently proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one of them. During a set up phase, the Sender gives information about the secrets to m servers. Afterwards, in a recovering phase, the receiver can compute the secret she wishes by interacting with k of them. More precisely, from the answers received she computes the secret in which she is interested but she gets no information on the others and, at the same time, any coalition of k - 1 servers can neither compute any secret nor figure out which one the receiver has recovered.We present an analysis and new results holding for this model: lower bounds on the resources required to implement such a scheme (i.e., randomness, memory storage, communication complexity); some impossibility results for one-round distributed oblivious transfer protocols; two polynomial-based constructions implementing 1-out-of-n distributed oblivious transfer, which generalize the two constructions for 1-out-of-2 given by Naor and Pinkas; as well as new one-round and two-round distributed oblivious transfer protocols, both for threshold and general access structures on the set of servers, which are optimal with respect to some of the given bounds. Most of these constructions are basically combinatorial in nature.