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
Banyak perkhidmatan dan protokol Internet harus menjamin kerahasiaan nama; sebagai contoh, sistem pengundian elektronik harus menjamin untuk mengelakkan pendedahan siapa yang mengundi calon mana. Untuk membuktikan ketanpanamaan jejak, yang merupakan lanjutan daripada rumusan tanpa nama oleh Schneider dan Sidiropoulos, makalah ini membentangkan kaedah induktif berdasarkan simulasi tanpa nama ke belakang. Kami menunjukkan bahawa kewujudan simulasi tanpa nama ke belakang terhingga imej membayangkan ketaknamaan jejak. Kami juga menunjukkan pengesahan tanpa nama bagi protokol e-undi (protokol FOO) dengan teknik simulasi tanpa nama ke belakang kami. Apabila membuktikan jejak tanpa nama, makalah ini menggunakan alat pengesahan berbantukan komputer berdasarkan prover teorem.
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.
Salinan
Yoshinobu KAWABE, Ken MANO, Hideki SAKURADA, Yasuyuki TSUKADA, "On Backward-Style Anonymity Verification" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 9, pp. 2597-2606, September 2008, doi: 10.1093/ietfec/e91-a.9.2597.
Abstract: Many Internet services and protocols should guarantee anonymity; for example, an electronic voting system should guarantee to prevent the disclosure of who voted for which candidate. To prove trace anonymity, which is an extension of the formulation of anonymity by Schneider and Sidiropoulos, this paper presents an inductive method based on backward anonymous simulations. We show that the existence of an image-finite backward anonymous simulation implies trace anonymity. We also demonstrate the anonymity verification of an e-voting protocol (the FOO protocol) with our backward anonymous simulation technique. When proving the trace anonymity, this paper employs a computer-assisted verification tool based on a theorem prover.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.9.2597/_p
Salinan
@ARTICLE{e91-a_9_2597,
author={Yoshinobu KAWABE, Ken MANO, Hideki SAKURADA, Yasuyuki TSUKADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Backward-Style Anonymity Verification},
year={2008},
volume={E91-A},
number={9},
pages={2597-2606},
abstract={Many Internet services and protocols should guarantee anonymity; for example, an electronic voting system should guarantee to prevent the disclosure of who voted for which candidate. To prove trace anonymity, which is an extension of the formulation of anonymity by Schneider and Sidiropoulos, this paper presents an inductive method based on backward anonymous simulations. We show that the existence of an image-finite backward anonymous simulation implies trace anonymity. We also demonstrate the anonymity verification of an e-voting protocol (the FOO protocol) with our backward anonymous simulation technique. When proving the trace anonymity, this paper employs a computer-assisted verification tool based on a theorem prover.},
keywords={},
doi={10.1093/ietfec/e91-a.9.2597},
ISSN={1745-1337},
month={September},}
Salinan
TY - JOUR
TI - On Backward-Style Anonymity Verification
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2597
EP - 2606
AU - Yoshinobu KAWABE
AU - Ken MANO
AU - Hideki SAKURADA
AU - Yasuyuki TSUKADA
PY - 2008
DO - 10.1093/ietfec/e91-a.9.2597
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2008
AB - Many Internet services and protocols should guarantee anonymity; for example, an electronic voting system should guarantee to prevent the disclosure of who voted for which candidate. To prove trace anonymity, which is an extension of the formulation of anonymity by Schneider and Sidiropoulos, this paper presents an inductive method based on backward anonymous simulations. We show that the existence of an image-finite backward anonymous simulation implies trace anonymity. We also demonstrate the anonymity verification of an e-voting protocol (the FOO protocol) with our backward anonymous simulation technique. When proving the trace anonymity, this paper employs a computer-assisted verification tool based on a theorem prover.
ER -