Efficient and secure multiparty computations using a standard deck of playing cards

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

It is known that secure multiparty computation can be performed using physical cards with identical backs, and numerous cardbased cryptographic protocols have been proposed. Almost all existing protocols require multiple cards that have the same pattern on their face sides; thus, a standard deck of playing cards cannot be used for executing these protocols. However, there is one exception: Niemi and Renvall’s protocols, proposed in 1999, can be used with standard playing cards. In this paper, we continue their efforts to improve secure multiparty computation using a standard deck of playing cards, and propose efficient AND, XOR, and copy protocols that require significantly fewer shuffles compared to previous protocols.

本文言語English
ホスト出版物のタイトルCryptology and Network Security - 15th International Conference, CANS 2016, Proceedings
編集者Giuseppe Persiano, Sara Foresti
出版社Springer Verlag
ページ484-499
ページ数16
ISBN(印刷版)9783319489643
DOI
出版ステータスPublished - 2016
イベント15th International Conference on Cryptology and Network Security, CANS 2016 - Milan, Italy
継続期間: 2016 11 142016 11 16

出版物シリーズ

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

Other

Other15th International Conference on Cryptology and Network Security, CANS 2016
CountryItaly
CityMilan
Period16/11/1416/11/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Efficient and secure multiparty computations using a standard deck of playing cards」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル