Analyzing execution time of card-based protocols

Daiki Miyahara, Itaru Ueda, Yu ichi Hayashi, Takaaki Mizuki, Hideaki Sone

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

Card-based cryptography is an attractive and unconventional computation model; it provides secure computing methods using a deck of physical cards. It is noteworthy that a card-based protocol can be easily executed by non-experts such as high school students without the use of any electric device. One of the main goals in this discipline is to develop efficient protocols. The efficiency has been evaluated by the number of required cards, the number of colors, and the average number of protocol trials. Although these evaluation metrics are simple and reasonable, it is difficult to estimate the total number of operations or execution time of protocols based only on these three metrics. Therefore, in this paper, we consider adding other metrics to estimate the execution time of protocols more precisely. Furthermore, we actually evaluate some of the important existing protocols using our new criteria.

本文言語English
ホスト出版物のタイトルUnconventional Computation and Natural Computation - 17th International Conference, UCNC 2018, Proceedings
編集者Susan Stepney, Sergey Verlan
出版社Springer Verlag
ページ145-158
ページ数14
ISBN(印刷版)9783319924342
DOI
出版ステータスPublished - 2018
イベント17th International Conference on Unconventional Computation and Natural Computation, UCNC 2018 - Fontainebleau, France
継続期間: 2018 6 252018 6 29

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10867 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other17th International Conference on Unconventional Computation and Natural Computation, UCNC 2018
CountryFrance
CityFontainebleau
Period18/6/2518/6/29

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Analyzing execution time of card-based protocols」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル