TY - GEN
T1 - Secure multiparty computations using a dial lock
AU - Mizuki, Takaaki
AU - Kugimoto, Yoshinori
AU - Sone, Hideaki
PY - 2007
Y1 - 2007
N2 - This paper first explores the power of the dial locks (also called the combination locks), which are physical handy devices, in designing cryptographic protocols. Specifically, we design protocols for secure multiparty computations using the dial locks, and give some conditions for a Boolean function to be or not to be securely computable by a dial lock, i.e., to be or not to be "dial-computable." In particular, we exhibit simple necessary and sufficient conditions for a symmetric function to be dial-computable.
AB - This paper first explores the power of the dial locks (also called the combination locks), which are physical handy devices, in designing cryptographic protocols. Specifically, we design protocols for secure multiparty computations using the dial locks, and give some conditions for a Boolean function to be or not to be securely computable by a dial lock, i.e., to be or not to be "dial-computable." In particular, we exhibit simple necessary and sufficient conditions for a symmetric function to be dial-computable.
UR - http://www.scopus.com/inward/record.url?scp=35449005808&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35449005808&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-72504-6_45
DO - 10.1007/978-3-540-72504-6_45
M3 - Conference contribution
AN - SCOPUS:35449005808
SN - 3540725032
SN - 9783540725039
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 499
EP - 510
BT - Theory and Applications of Models of Computation - 4th International Conference, TAMC 2007, Proceedings
PB - Springer Verlag
T2 - 4th International Conference on Theory and Applications of Models of Computation, TAMC 2007
Y2 - 22 May 2007 through 25 May 2007
ER -