Spécification et vérification des protocoles de sécurité probabilistes. (Probabilistic and Information-Theoretic Approaches to Anonymity)
暂无分享,去创建一个
[1] Paul F. Syverson,et al. Anonymous connections and onion routing , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).
[2] Paul F. Syverson,et al. Group Principals and the Formalization of Anonymity , 1999, World Congress on Formal Methods.
[3] Thomas A. Henzinger,et al. Compositional Methods for Probabilistic Systems , 2001, CONCUR.
[4] Peter Y. A. Ryan,et al. Modelling and analysis of security protocols , 2001 .
[5] Steve A. Schneider,et al. CSP and Anonymity , 1996, ESORICS.
[6] Ian Clarke,et al. Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[7] Bengt Jonsson,et al. A framework for reasoning about time and reliability , 1989, [1989] Proceedings. Real-Time Systems Symposium.
[8] Stephen E. Deering,et al. Host extensions for IP multicasting , 1986, RFC.
[9] Vitaly Shmatikov,et al. Probabilistic analysis of anonymity , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.
[10] Robert M. Gray,et al. Entropy and Information , 1990 .
[11] Wang Yi,et al. Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.
[12] Ira S. Moskowitz,et al. Covert channels and anonymizing networks , 2003, WPES '03.
[13] Chris Hankin,et al. Measuring the confinement of probabilistic systems , 2005, Theor. Comput. Sci..
[14] Catuscia Palamidessi,et al. Probable Innocence Revisited , 2005, Formal Aspects in Security and Trust.
[15] Moshe Y. Vardi. Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[16] Tom Chothia,et al. A Survey of Anonymous Peer-to-Peer File-Sharing , 2005, EUC Workshops.
[17] Aaron D. Wyner,et al. Some Geometrical Results in Channel CapacityNachrichtentechnische Zeit, vol. 10. 1957. , 1993 .
[18] Riccardo Bettati,et al. Anonymity vs. Information Leakage in Anonymity Systems , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).
[19] Prakash Panangaden,et al. Probability of Error in Information-Hiding Protocols , 2007, 20th IEEE Computer Security Foundations Symposium (CSF'07).
[20] Roberto Segala,et al. Modeling and verification of randomized distributed real-time systems , 1996 .
[21] James W. Gray,et al. Toward a mathematical foundation for information flow security , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.
[22] R. Rivest. The ThreeBallot Voting System , 2006 .
[23] Jun Pang,et al. Measuring Anonymity with Relative Entropy , 2006, Formal Aspects in Security and Trust.
[24] Nancy A. Lynch,et al. Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..
[25] Catuscia Palamidessi,et al. A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange , 2005, TGC.
[26] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[27] Roberto Gorrieri,et al. Security Analysis of a Probabilistic Non-repudiation Protocol , 2002, PAPM-PROBMIV.
[28] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[29] Vitaly Shmatikov,et al. Probabilistic Model Checking of an Anonymity System , 2004 .
[30] John McLean,et al. Security models and information flow , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.
[31] Keye Martin,et al. A Monotonicity Principle for Information Theory , 2008, MFPS.
[32] Bengt Jonsson,et al. A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[33] David Sands,et al. Probabilistic noninterference for multi-threaded programs , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.
[34] Oltea Mihaela Herescu. Probabilistic asynchronous π-calculus ∗ , 2000 .
[35] Paul Syverson,et al. Quasi-Anonymous Channels , 2003 .
[36] Martin E. Hellman,et al. Probability of error, equivocation, and the Chernoff bound , 1970, IEEE Trans. Inf. Theory.
[37] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[38] France T́elécom,et al. Verifying Properties of Electronic Voting Protocols , 2006 .
[39] Keye Martin. Topology in information theory in topology , 2008, Theor. Comput. Sci..
[40] Jun Pang,et al. Weak Probabilistic Anonymity , 2007, SecCO@CONCUR.
[41] Andreas Pfitzmann,et al. Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[42] Chris Hankin,et al. Approximate non-interference , 2004 .
[43] Ana Sokolova,et al. Probabilistic Anonymity and Admissible Schedulers , 2007, ArXiv.
[44] Catuscia Palamidessi,et al. A randomized encoding of the Pi-calculus with mixed choice , 2005, Theor. Comput. Sci..
[45] George Danezis,et al. Towards an Information Theoretic Metric for Anonymity , 2002, Privacy Enhancing Technologies.
[46] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[47] Joël Ouaknine,et al. Axioms for Probability and Nondeterminism , 2004, EXPRESS.
[48] Bart Preneel,et al. Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.
[49] Bengt Jonsson,et al. Probabilistic Process Algebra , 2001 .
[50] Michael K. Reiter,et al. Crowds: anonymity for Web transactions , 1998, TSEC.
[51] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[52] David Clark,et al. Quantified Interference for a While Language , 2005, QAPL.
[53] Vitaly Shmatikov,et al. Information Hiding, Anonymity and Privacy: a Modular Approach , 2004, J. Comput. Secur..
[54] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[55] Prakash Panangaden,et al. Anonymity protocols as noisy channels , 2008, Inf. Comput..
[56] L. E. Clarke,et al. Probability and Measure , 1980 .
[57] David Clark,et al. Quantitative Analysis of the Leakage of Confidential Data , 2002, QAPL.
[58] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[59] Alexander Vardy,et al. On an Improvement over Rényi's Equivocation Bound , 2006, ArXiv.
[60] Marta Z. Kwiatkowska,et al. PRISM 2.0: a tool for probabilistic model checking , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..
[61] Wang Yi,et al. Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.
[62] Ueli Maurer,et al. Authentication theory and hypothesis testing , 2000, IEEE Trans. Inf. Theory.
[63] Micah Adler,et al. An Analysis of the Degradation of Anonymous Protocols , 2002, NDSS.
[64] Catuscia Palamidessi,et al. Probabilistic Anonymity , 2005, CONCUR.
[65] David Chaum,et al. The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.
[66] Martín Abadi,et al. A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.
[67] Joseph Y. Halpern,et al. Anonymity and information hiding in multiagent systems , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..
[68] Vitaly Shmatikov,et al. Analysis of probabilistic contract signing , 2002, J. Comput. Secur..
[69] Catuscia Palamidessi,et al. Making Random Choices Invisible to the Scheduler , 2007, CONCUR.
[70] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[71] Roberto Di Cosmo,et al. On privacy and anonymity in electronic and non electronic voting: the ballot-as-signature attack. , 2007 .
[72] Gavin Lowe,et al. Quantifying information flow , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.
[73] Catuscia Palamidessi,et al. Probabilistic Asynchronous pi-Calculus , 2000, FoSSaCS.
[74] Roberto Segala,et al. Axiomatizations for Probabilistic Bisimulation , 2001, ICALP.