Zobrazeno 1 - 10
of 157
pro vyhledávání: '"Hideaki Sone"'
Publikováno v:
IEEE Transactions on Electromagnetic Compatibility. :1-9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73efb8c6d8206f0b20227d4a54e4124a
https://doi.org/10.1109/temc.2023.3264586
https://doi.org/10.1109/temc.2023.3264586
Publikováno v:
Natural Computing. 20:639-645
In the research area of card-based cryptography, designing committed-format AND protocols that are efficient in terms of the number of required cards is a major topic. Such an AND protocol should receive two pairs of face-down (physical) cards repres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ef2feb83f0bd2b0c70a6334d3fdfbb2
https://doi.org/10.1007/s11047-021-09862-2
https://doi.org/10.1007/s11047-021-09862-2
Publikováno v:
Natural Computing. 21:615-628
In 1989, den Boer presented the first card-based protocol, called the “five-card trick,” that securely computes the AND function using a deck of physical cards via a series of actions such as shuffling and turning over cards. This protocol enable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77b10248c224ce189b1753ca3d1f7a1f
https://doi.org/10.1007/s11047-020-09838-8
https://doi.org/10.1007/s11047-020-09838-8
Publikováno v:
New Generation Computing. 39:97-114
In card-based cryptography, designing AND protocols in committed format is a major research topic. The state-of-the-art AND protocol proposed by Koch, Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53071fc38a6c942ce938a0f4a6c93a3d
https://doi.org/10.1007/s00354-020-00110-2
https://doi.org/10.1007/s00354-020-00110-2
Autor:
Kazumasa Shinagawa, Yuta Abe, Ken Takashima, Takaaki Mizuki, Daiki Miyahara, Hideaki Sone, Tatsuya Sasaki
Publikováno v:
Theoretical Computer Science. 845:122-135
Consider a group of people who want to know the “rich list” among them, namely the ranking in terms of their total assets, without revealing any information about the actual value of their assets. This can be achieved by a “secure ranking compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18f063ada97c11feecd39683010036d6
https://doi.org/10.1016/j.tcs.2020.09.008
https://doi.org/10.1016/j.tcs.2020.09.008
Autor:
Taiki Kitazawa, Yoshiki Kitamura, Yougwoo Kim, Daisuke Fujimoto, Hideaki Sone, Yuichi Hayashi
Publikováno v:
2022 3rd URSI Atlantic and Asia Pacific Radio Science Meeting (AT-AP-RASC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::257d155eb1dd7c87be1f489e0f1e9d0a
https://doi.org/10.23919/at-ap-rasc54737.2022.9814293
https://doi.org/10.23919/at-ap-rasc54737.2022.9814293
Publikováno v:
2021 13th International Workshop on the Electromagnetic Compatibility of Integrated Circuits (EMC Compo).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56aa53c5a19d8ed7cce0c6ef06b7dbd9
https://doi.org/10.1109/emccompo52133.2022.9758626
https://doi.org/10.1109/emccompo52133.2022.9758626
Publikováno v:
International Journal of Information Security. 20:729-740
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cf79f9b488710c8c776ffd9291471aa
https://doi.org/10.1007/s10207-020-00525-4
https://doi.org/10.1007/s10207-020-00525-4
Publikováno v:
Theoretical Computer Science. 839:135-142
In 2009, Gradwohl, Naor, Pinkas, and Rothblum proposed physical zero-knowledge proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols allow a prover to convince a verifier that there is a solution to the Sudok
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9eeea65591673aa6209c1f052f644398
https://doi.org/10.1016/j.tcs.2020.05.036
https://doi.org/10.1016/j.tcs.2020.05.036
Publikováno v:
Theoretical Computer Science. 803:207-221
Yao's millionaire protocol enables Alice and Bob to know whether or not Bob is richer than Alice by using a public-key cryptosystem without revealing the actual amounts of their properties. In this paper, we present simple and practical implementatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae90393eab989a6de77209a5f74b668b
https://doi.org/10.1016/j.tcs.2019.11.005
https://doi.org/10.1016/j.tcs.2019.11.005