A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
We develop the privacy preserving computation protocol presented by Naor, Pinkas and Sumner at ACM Conference on Electronic Commerce in 1999 into a more efficient one. Their protocol is based on the Yao's two-party secure function evaluation and can be used to implement any combinatorial circuit for input clients' data without disclosing them. In this paper we propose three types of protocol as variants of the Naor-Pinkas-Sumner protocol in each different framework. The first protocol is the almost same framework as theirs but requires no public key cryptographic operations for clients unlike their protocol. The second protocol furthermore eliminates an oblivious transfer from the two-party operation in their protocol and the first protocol by adding a new entity named "mediator" into the Yao's two-party setting. In the new three-party setting, it is assumed that no party colludes with any other parties to retain the secrecy of the clients' data. The last protocol removes the mediator from the second protocol in return for clients' some additional burden. Since an oblivious transfer used in the Naor-Pinkas-Sumner protocol and the first protocol is the dominant step in each protocol, the second and last protocols are expected to be much faster than the others.