Secure multiparty computations using a dial lock

Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 4th International Conference, TAMC 2007, Proceedings
PublisherSpringer Verlag
Pages499-510
Number of pages12
ISBN (Print)3540725032, 9783540725039
DOIs
Publication statusPublished - 2007
Event4th International Conference on Theory and Applications of Models of Computation, TAMC 2007 - Shanghai, China
Duration: 2007 May 222007 May 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4484 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Theory and Applications of Models of Computation, TAMC 2007
CountryChina
CityShanghai
Period07/5/2207/5/25

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Secure multiparty computations using a dial lock'. Together they form a unique fingerprint.

Cite this