The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A criptografia baseada em cartão realiza computação multipartidária segura usando cartões físicos. Em 2018, Watanabe et al. propôs um protocolo de votação por maioria de três entradas baseado em cartão usando três cartões. Em um protocolo criptográfico baseado em cartão com nentradas de -bit, sabe-se que um protocolo usando embaralha requer pelo menos 2n cartões. Em contraste, conforme o protocolo de Watanabe et al., um protocolo usando permutações privadas pode ser construído com menos cartas do que os limites inferiores acima. Além disso, um n-o protocolo de entrada usando permutações privadas nem exigiria n cartões em princípio, uma vez que uma permutação privada dependendo de uma entrada pode representar a entrada sem usar cartões adicionais. No entanto, existem apenas alguns protocolos com menos de n cartões. Recentemente, Abe et al. estendeu o protocolo de Watanabe et al. e propôs um n-introduzir protocolo de votação por maioria com n cartões e n +⌊n/2⌋ + 1 permutações privadas. Este artigo propõe uma n-entrar protocolo de votação por maioria com ⌈n/2⌉ + 1 cartas e 2n-1 permutações privadas, que também é obtida estendendo o protocolo de Watanabe et al. Comparado com o protocolo de Abe et al., embora o número de permutações privadas aumente cerca de n/2, o número de cartas é reduzido em cerca de n/2. Além disso, diferentemente do protocolo de Abe et al., nosso protocolo inclui o protocolo de Watanabe et al. n= 3.
Yoshiki ABE
The University of Electro-Communications,National Institute of Advanced Industrial Science and Technology (AIST)
Takeshi NAKAI
Toyohashi University of Technology
Yohei WATANABE
The University of Electro-Communications,National Institute of Advanced Industrial Science and Technology (AIST)
Mitsugu IWAMOTO
The University of Electro-Communications
Kazuo OHTA
The University of Electro-Communications,National Institute of Advanced Industrial Science and Technology (AIST)
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yoshiki ABE, Takeshi NAKAI, Yohei WATANABE, Mitsugu IWAMOTO, Kazuo OHTA, "A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 3, pp. 315-324, March 2023, doi: 10.1587/transfun.2022CIP0021.
Abstract: Card-based cryptography realizes secure multiparty computation using physical cards. In 2018, Watanabe et al. proposed a card-based three-input majority voting protocol using three cards. In a card-based cryptographic protocol with n-bit inputs, it is known that a protocol using shuffles requires at least 2n cards. In contrast, as Watanabe et al.'s protocol, a protocol using private permutations can be constructed with fewer cards than the lower bounds above. Moreover, an n-input protocol using private permutations would not even require n cards in principle since a private permutation depending on an input can represent the input without using additional cards. However, there are only a few protocols with fewer than n cards. Recently, Abe et al. extended Watanabe et al.'s protocol and proposed an n-input majority voting protocol with n cards and n + ⌊n/2⌋ + 1 private permutations. This paper proposes an n-input majority voting protocol with ⌈n/2⌉ + 1 cards and 2n-1 private permutations, which is also obtained by extending Watanabe et al.'s protocol. Compared with Abe et al.'s protocol, although the number of private permutations increases by about n/2, the number of cards is reduced by about n/2. In addition, unlike Abe et al.'s protocol, our protocol includes Watanabe et al.'s protocol as a special case where n=3.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022CIP0021/_p
Copiar
@ARTICLE{e106-a_3_315,
author={Yoshiki ABE, Takeshi NAKAI, Yohei WATANABE, Mitsugu IWAMOTO, Kazuo OHTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model},
year={2023},
volume={E106-A},
number={3},
pages={315-324},
abstract={Card-based cryptography realizes secure multiparty computation using physical cards. In 2018, Watanabe et al. proposed a card-based three-input majority voting protocol using three cards. In a card-based cryptographic protocol with n-bit inputs, it is known that a protocol using shuffles requires at least 2n cards. In contrast, as Watanabe et al.'s protocol, a protocol using private permutations can be constructed with fewer cards than the lower bounds above. Moreover, an n-input protocol using private permutations would not even require n cards in principle since a private permutation depending on an input can represent the input without using additional cards. However, there are only a few protocols with fewer than n cards. Recently, Abe et al. extended Watanabe et al.'s protocol and proposed an n-input majority voting protocol with n cards and n + ⌊n/2⌋ + 1 private permutations. This paper proposes an n-input majority voting protocol with ⌈n/2⌉ + 1 cards and 2n-1 private permutations, which is also obtained by extending Watanabe et al.'s protocol. Compared with Abe et al.'s protocol, although the number of private permutations increases by about n/2, the number of cards is reduced by about n/2. In addition, unlike Abe et al.'s protocol, our protocol includes Watanabe et al.'s protocol as a special case where n=3.},
keywords={},
doi={10.1587/transfun.2022CIP0021},
ISSN={1745-1337},
month={March},}
Copiar
TY - JOUR
TI - A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 315
EP - 324
AU - Yoshiki ABE
AU - Takeshi NAKAI
AU - Yohei WATANABE
AU - Mitsugu IWAMOTO
AU - Kazuo OHTA
PY - 2023
DO - 10.1587/transfun.2022CIP0021
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2023
AB - Card-based cryptography realizes secure multiparty computation using physical cards. In 2018, Watanabe et al. proposed a card-based three-input majority voting protocol using three cards. In a card-based cryptographic protocol with n-bit inputs, it is known that a protocol using shuffles requires at least 2n cards. In contrast, as Watanabe et al.'s protocol, a protocol using private permutations can be constructed with fewer cards than the lower bounds above. Moreover, an n-input protocol using private permutations would not even require n cards in principle since a private permutation depending on an input can represent the input without using additional cards. However, there are only a few protocols with fewer than n cards. Recently, Abe et al. extended Watanabe et al.'s protocol and proposed an n-input majority voting protocol with n cards and n + ⌊n/2⌋ + 1 private permutations. This paper proposes an n-input majority voting protocol with ⌈n/2⌉ + 1 cards and 2n-1 private permutations, which is also obtained by extending Watanabe et al.'s protocol. Compared with Abe et al.'s protocol, although the number of private permutations increases by about n/2, the number of cards is reduced by about n/2. In addition, unlike Abe et al.'s protocol, our protocol includes Watanabe et al.'s protocol as a special case where n=3.
ER -