Formalizing provable anonymity in Isabelle/HOL

Verfasser / Beitragende:
[Yongjian Li, Jun Pang]
Ort, Verlag, Jahr:
2015
Enthalten in:
Formal Aspects of Computing, 27/2(2015-03-01), 255-282
Format:
Artikel (online)
ID: 605516383
LEADER caa a22 4500
001 605516383
003 CHVBK
005 20210128100714.0
007 cr unu---uuuuu
008 210128e20150301xx s 000 0 eng
024 7 0 |a 10.1007/s00165-014-0315-x  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00165-014-0315-x 
245 0 0 |a Formalizing provable anonymity in Isabelle/HOL  |h [Elektronische Daten]  |c [Yongjian Li, Jun Pang] 
520 3 |a We formalize in a theorem prover the notion of provable anonymity. Our formalization relies on inductive definitions of message distinguishing ability and observational equivalence on traces observed by the intruder. Our theory differs from its original proposal and essentially boils down to the inductive definition of distinguishing messages with respect to a knowledge set for the intruder. We build our theory in Isabelle/HOL to achieve a mechanical framework for the analysis of anonymity protocols. Its feasibility is illustrated through two case studies of the Crowds and Onion Routing protocols. 
540 |a British Computer Society, 2014 
690 7 |a Anonymity  |2 nationallicence 
690 7 |a Security protocols  |2 nationallicence 
690 7 |a Theorem proving  |2 nationallicence 
690 7 |a Inductive methods  |2 nationallicence 
700 1 |a Li  |D Yongjian  |u State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8717, Beijing, China  |4 aut 
700 1 |a Pang  |D Jun  |u Computer Science and Communications, Faculty of Science, Technology and Communication, University of Luxembourg, Walferdange, Luxembourg  |4 aut 
773 0 |t Formal Aspects of Computing  |d Springer London  |g 27/2(2015-03-01), 255-282  |x 0934-5043  |q 27:2<255  |1 2015  |2 27  |o 165 
856 4 0 |u https://doi.org/10.1007/s00165-014-0315-x  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00165-014-0315-x  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Li  |D Yongjian  |u State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8717, Beijing, China  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Pang  |D Jun  |u Computer Science and Communications, Faculty of Science, Technology and Communication, University of Luxembourg, Walferdange, Luxembourg  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Formal Aspects of Computing  |d Springer London  |g 27/2(2015-03-01), 255-282  |x 0934-5043  |q 27:2<255  |1 2015  |2 27  |o 165