All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Secret ballot elections in computer networks
Computers and Security
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Cryptographic Protocols and Voting
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Blind Decoding, Blind Undeniable Signatures, and Their Applications to Privacy Protection
Proceedings of the First International Workshop on Information Hiding
ISW '97 Proceedings of the First International Workshop on Information Security
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Preserving privacy in a network of mobile computers
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Quantum symmetrically-private information retrieval
Information Processing Letters
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
A knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
Threshold cryptography based on Asmuth-Bloom secret sharing
Information Sciences: an International Journal
Information Sciences: an International Journal
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
An oblivious transfer protocol with log-squared communication
ISC'05 Proceedings of the 8th international conference on Information Security
Two cooperative versions of the Guessing Secrets problem
Information Sciences: an International Journal
| Hi-index | 0.07 |
This paper deals with the original work due to Brassard et al., in which an algorithm to sell only one secret to one buyer was introduced. It is based on the theory of quadratic residues modulo an integer number and Jacobi symbols. Unfortunately, this algorithm exhibits an important security drawback: the seller can disclose more than one secret to the buyer instead of only one. This problem was overcome by other sophisticated protocols. Although such problem has been satisfactorily tackled, the main goal of this work is to modify the original work (preserving its flavour) in order to securely disclose multiple secrets without the participation of more buyers but with a third trusted party.