Secure computations in a minimal model using multiple-valued ESOP expressions

Authors:
Takaaki Mizuki;Taro Otagiri;Hideaki Sone
Affiliations:
Information Synergy Center, Tohoku University, Sendai, Japan;Sone Lab., Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Information Synergy Center, Tohoku University, Sendai, Japan
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 13
Cited 1

A Computer Algorithm for Minimizing Reed-Muller Canonical Forms

IEEE Transactions on Computers
On the Complexity of Mod-2l Sum PLA's

IEEE Transactions on Computers
A minimal model for secure computation (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Characterizing linear size circuits in terms of privacy

Journal of Computer and System Sciences
Switching Theory for Logic Synthesis

Switching Theory for Logic Synthesis
A Theorem on Sensitivity and Applications in Private Computation

SIAM Journal on Computing
One-Round Secure Computation and Secure Autonomous Mobile Agents

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Optimistic Fair Secure Computation

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Lower bounds on the amount of randomness in private computation

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Private Simultaneous Messages Protocols with Applications

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Secure multiparty computations using a dial lock

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with secure computations in a minimal model, and gives a protocol which securely computes every function by means of the techniques of exclusive-or sum-of-products (ESOP) expressions. The communication complexity of our protocol is proportional to the size of an obtained multiple-valued-input ESOP expression. Since the historical research on minimizing ESOP expressions is now still active, our protocol will turn to an efficient one as this research progresses. Thus, this paper gives an application of ESOP expressions to designing cryptographic protocols, and we hope that it would motivate further research on minimizing ESOP expressions.