How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
A randomized protocol for signing contracts
Communications of the ACM
How to construct random functions
Journal of the ACM (JACM)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A communication-privacy tradeoff for modular addition
Information Processing Letters
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Commodity-based cryptography (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Communications of the ACM
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
Share conversion, pseudorandom secret-sharing and applications to secure computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Hi-index | 0.00 |
A private-key cryptosystem may be viewed as a means by which a trusted dealer privately conveys a large, shared pseudo-random object to a pair of players, using little communication. Alternatively, the messages distributed by the dealer may be viewed as a secure compression of a pair of large identical random pads (or random functions) into a shorter shared "key" or "seed". We pose the question of extending this compression problem to more general correlation patterns among several players. Unlike the simple case of identical pads, where the main security concern is with respect to external eavesdroppers, in the case of general correlations participants also have to be protected from each other. That is, collusions of computationally-bounded players should gain no additional knowledge about the joint pads of the remaining players from the compressed messages they receive, other than what follows from the pads they generate and from knowing the joint distribution of all pads. While this ideal requirement is inherently impossible to meet using little communication, it turns out that it can be approximated to a satisfactory level, allowing to securely use such compressed correlated pads in a wide class of protocols. We propose a simple and modular replication-based approach for securely compressing any linear correlation pattern, using pseudo-random generators or pseudo-random functions in a black-box manner. Applications include amortizing the communication costs of private multiparty computation and proactive secret-sharing of large secrets.