Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Selective private function evaluation with applications to private statistics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Private Computation with Shared Randomness over Broadcast Channel
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Secure Distributed Linear Algebra in a Constant Number of Rounds
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On 2-Round Secure Multiparty Computation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Universally Composable Adaptive Priced Oblivious Transfer
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Some applications of polynomials for the design of cryptographic protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Alternative protocols for generalized oblivious transfer
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Secure multiparty computation with minimal interaction
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Generalized oblivious transfer by secret sharing
Designs, Codes and Cryptography
Round-efficient sub-linear zero-knowledge arguments for linear algebra
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Restricted adaptive oblivious transfer
Theoretical Computer Science
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Secure computations in a minimal model using multiple-valued ESOP expressions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Efficient polynomial operations in the shared-coefficients setting
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Design and implementation of privacy preserving billing protocol for smart grid
The Journal of Supercomputing
| Hi-index | 0.00 |
We study the Private Simultaneous Messages (PSM)} model which is a variant of the model proposed by Feige, Kilian and Naor (STOC '94). In the PSM model there are n players P_1,\ldots,P_n, each player P_i holding a secret input x_i (say, a bit), and all having access to a common random string. Each player sends a single message to a special player, Carol, depending on its own input and the random string (and independently of all other messages). Based on these messages, Carol should be able to compute f(x_1,\ldots,x_n) (for some predetermined function f) but should learn no additional information on the values of x_1,\ldots,x_n.Our results go in two directions. First, we present efficient PSM protocols, which improve the efficiency of previous solutions, and extend their scope to several function classes for which no such solutions were known before. These classes include most of the important linear algebraic functions; as a result, we get efficient constant-round private protocols (in the standard model) for these classes. Second, we present reductions that allow transforming PSM protocols into solutions for some other problems, thereby demonstrating the power of this model. An interesting reduction of this sort shows how to construct, based on a standard \OT (Oblivious Transfer) primitive, generalized-OT (GOT) primitives that, we believe, might be useful for the design of cryptographic protocols.