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
Na criptografia baseada em cartões, um baralho de cartas físicas é usado para obter uma computação segura. Um embaralhamento, que permuta aleatoriamente uma sequência de cartas junto com alguma distribuição de probabilidade, garante a segurança de um protocolo baseado em cartas. Os autores propuseram uma nova classe de embaralhamentos chamada embaralhamentos de grafos, que permuta aleatoriamente uma sequência de cartas por um automorfismo de um gráfico direcionado (New Generation Computing 2022). Para um gráfico direcionado G fazendo o melhor dos nossos n vértices e m bordas, tal embaralhamento poderia ser implementado com embaralhamento de pilha com 2(n + m) cartões. Neste artigo, estudamos embaralhamentos de grafos e fornecemos uma implementação, uma aplicação e uma ligeira generalização. Primeiro, propomos um novo protocolo para embaralhamento de grafos com 2n + m cartões. Em segundo lugar, como uma nova aplicação de embaralhamento de grafos, mostramos que qualquer embaralhamento de grupo cíclico, que é um embaralhamento sobre um grupo cíclico, é um embaralhamento de grafos associado a algum grafo. Terceiro, definimos um embaralhamento de hipergrafo, que é um embaralhamento por um automorfismo de um hipergrafo, e mostramos que qualquer embaralhamento de hipergrafo também pode ser implementado com embaralhamento de pilha.
Kazumasa SHINAGAWA
Ibaraki University,National Institute of Advanced Industrial Science and Technology (AIST)
Kengo MIYAMOTO
Ibaraki University
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
Kazumasa SHINAGAWA, Kengo MIYAMOTO, "Automorphism Shuffles for Graphs and Hypergraphs and Its Applications" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 3, pp. 306-314, March 2023, doi: 10.1587/transfun.2022CIP0020.
Abstract: In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes a card-sequence along with some probability distribution, ensures the security of a card-based protocol. The authors proposed a new class of shuffles called graph shuffles, which randomly permutes a card-sequence by an automorphism of a directed graph (New Generation Computing 2022). For a directed graph G with n vertices and m edges, such a shuffle could be implemented with pile-scramble shuffles with 2(n + m) cards. In this paper, we study graph shuffles and give an implementation, an application, and a slight generalization. First, we propose a new protocol for graph shuffles with 2n + m cards. Second, as a new application of graph shuffles, we show that any cyclic group shuffle, which is a shuffle over a cyclic group, is a graph shuffle associated with some graph. Third, we define a hypergraph shuffle, which is a shuffle by an automorphism of a hypergraph, and show that any hypergraph shuffle can also be implemented with pile-scramble shuffles.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022CIP0020/_p
Copiar
@ARTICLE{e106-a_3_306,
author={Kazumasa SHINAGAWA, Kengo MIYAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Automorphism Shuffles for Graphs and Hypergraphs and Its Applications},
year={2023},
volume={E106-A},
number={3},
pages={306-314},
abstract={In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes a card-sequence along with some probability distribution, ensures the security of a card-based protocol. The authors proposed a new class of shuffles called graph shuffles, which randomly permutes a card-sequence by an automorphism of a directed graph (New Generation Computing 2022). For a directed graph G with n vertices and m edges, such a shuffle could be implemented with pile-scramble shuffles with 2(n + m) cards. In this paper, we study graph shuffles and give an implementation, an application, and a slight generalization. First, we propose a new protocol for graph shuffles with 2n + m cards. Second, as a new application of graph shuffles, we show that any cyclic group shuffle, which is a shuffle over a cyclic group, is a graph shuffle associated with some graph. Third, we define a hypergraph shuffle, which is a shuffle by an automorphism of a hypergraph, and show that any hypergraph shuffle can also be implemented with pile-scramble shuffles.},
keywords={},
doi={10.1587/transfun.2022CIP0020},
ISSN={1745-1337},
month={March},}
Copiar
TY - JOUR
TI - Automorphism Shuffles for Graphs and Hypergraphs and Its Applications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 306
EP - 314
AU - Kazumasa SHINAGAWA
AU - Kengo MIYAMOTO
PY - 2023
DO - 10.1587/transfun.2022CIP0020
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2023
AB - In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes a card-sequence along with some probability distribution, ensures the security of a card-based protocol. The authors proposed a new class of shuffles called graph shuffles, which randomly permutes a card-sequence by an automorphism of a directed graph (New Generation Computing 2022). For a directed graph G with n vertices and m edges, such a shuffle could be implemented with pile-scramble shuffles with 2(n + m) cards. In this paper, we study graph shuffles and give an implementation, an application, and a slight generalization. First, we propose a new protocol for graph shuffles with 2n + m cards. Second, as a new application of graph shuffles, we show that any cyclic group shuffle, which is a shuffle over a cyclic group, is a graph shuffle associated with some graph. Third, we define a hypergraph shuffle, which is a shuffle by an automorphism of a hypergraph, and show that any hypergraph shuffle can also be implemented with pile-scramble shuffles.
ER -