Universally verifiable Mix-net with verification work indendent of the number of Mixservers, Advances in Cryptology, EUROCRYPT, volume 1403 of LNCS, pp.437-447, 1998. ,
Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems, Lecture Notes in Computer Science, vol.2137, pp.245-257, 2001. ,
DOI : 10.1007/3-540-45496-9_18
Anonymous Webs of Trust, 10th Privacy Enhancing Technologies Symposium, PETS 2010, LNCS series, 2010. ,
DOI : 10.1007/978-3-642-14527-8_8
Denial of service or denial of security?, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.92-102, 2007. ,
DOI : 10.1145/1315245.1315258
A Formal Treatment of Onion Routing, Lecture Notes in Computer Science, vol.3621, pp.169-187, 2005. ,
DOI : 10.1007/11535218_11
Probable innocence revisited, Theoretical Computer Science, vol.367, issue.1-2, pp.123-138, 2006. ,
DOI : 10.1016/j.tcs.2006.08.033
URL : https://hal.archives-ouvertes.fr/inria-00201109
Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, vol.24, issue.2, pp.84-88, 1981. ,
DOI : 10.1145/358549.358563
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.8210
Fuzzy logic techniques for reputation management in anonymous peer-to-peer systems, Proceedings of the 3rd Conference of the European Society for Fuzzy Logic and Technology, pp.43-48, 2003. ,
A reputation-based approach for choosing reliable resources in peer-to-peer networks, Proceedings of the 9th ACM conference on Computer and communications security , CCS '02, pp.207-216, 2002. ,
DOI : 10.1145/586110.586138
A Reputation System to Increase MIX-Net Reliability, Lecture Notes in Computer Science, vol.2137, pp.126-141, 2001. ,
DOI : 10.1007/3-540-45496-9_10
Tor: The second-generation onion router, USENIX Security Symposium, pp.303-320, 2004. ,
Reliable MIX Cascade Networks through Reputation, Lecture Notes in Computer Science, vol.2357, pp.253-268, 2002. ,
DOI : 10.1007/3-540-36504-4_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9316
An analysis of the exponential decay principle in probabilistic trust models, Theoretical Computer Science, vol.410, issue.41, pp.4104067-4084, 2009. ,
DOI : 10.1016/j.tcs.2009.06.011
HMM-Based Trust Model, Formal Aspects in Security and Trust, pp.21-35, 2009. ,
DOI : 10.1007/978-3-642-12459-4_3
A practical congestion attack on Tor using long paths, Proceedings of the 18th USENIX Security Symposium, 2009. ,
Probabilistic analysis of onion routing in a black-box model, Proceedings of the 2007 ACM workshop on Privacy in electronic society, WPES '07, pp.1-10, 2007. ,
Tarzan, Proceedings of the 9th ACM conference on Computer and communications security , CCS '02, pp.193-206, 2002. ,
DOI : 10.1145/586110.586137
Anonymity and information hiding in multiagent systems, Journal of Computer Security, vol.13, issue.3, pp.483-512, 2005. ,
DOI : 10.3233/JCS-2005-13305
Probable Innocence in the Presence of Independent Knowledge, Formal Aspects in Security and Trust, pp.141-156, 2009. ,
DOI : 10.1007/978-3-642-12459-4_11
Reconciling Belief and Vulnerability in Information Flow, 2010 IEEE Symposium on Security and Privacy, pp.79-92, 2010. ,
DOI : 10.1109/SP.2010.13
URL : https://hal.archives-ouvertes.fr/inria-00548007
How much anonymity does network latency leak?, ACM Trans. Inf. Syst. Secur, vol.13, issue.2, 2010. ,
DOI : 10.1145/1315245.1315257
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.1587
Flash mixing, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.83-89, 1999. ,
DOI : 10.1145/301308.301333
More Anonymous Onion Routing Through Trust, 2009 22nd IEEE Computer Security Foundations Symposium, pp.3-12, 2009. ,
DOI : 10.1109/CSF.2009.27
Trust-based anonymous communication, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, pp.175-186, 2011. ,
DOI : 10.1145/2046707.2046729
A logical framework for history-based access control and reputation systems, Journal of Computer Security, vol.16, issue.1, pp.63-101, 2008. ,
DOI : 10.3233/JCS-2008-16102
Don???t Clog the Queue! Circuit Clogging and Mitigation in P2P Anonymity Schemes, Lecture Notes in Computer Science, vol.5143, pp.31-46, 2008. ,
DOI : 10.1007/978-3-540-85230-8_3
Scalable onion routing with torsk, Proceedings of the 16th ACM conference on Computer and communications security, CCS '09, pp.590-599, 2009. ,
DOI : 10.1145/1653662.1653733
Low-Cost Traffic Analysis of Tor, 2005 IEEE Symposium on Security and Privacy (S&P'05), pp.183-195, 2005. ,
DOI : 10.1109/SP.2005.12
Salsa, Proceedings of the 13th ACM conference on Computer and communications security , CCS '06, pp.17-26, 2006. ,
DOI : 10.1145/1180405.1180409
A verifiable secret shuffle and its application to e-voting, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.116-125, 2001. ,
DOI : 10.1145/501983.502000
A Length-Invariant Hybrid Mix, Lecture Notes in Computer Science, pp.178-191, 1976. ,
DOI : 10.1007/3-540-44448-3_14
Compromising Anonymity Using Packet Spinning, Lecture Notes in Computer Science, vol.5222, pp.161-174, 2008. ,
DOI : 10.1007/978-3-540-85886-7_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.8245
Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security, vol.1, issue.1, pp.66-92, 1998. ,
DOI : 10.1145/290163.290168
Introducing MorphMix, Proceeding of the ACM workshop on Privacy in the Electronic Society , WPES '02, pp.91-102, 2002. ,
DOI : 10.1145/644527.644537
Trust in Crowds: Probabilistic Behaviour in Anonymity Protocols, Symposium on Trustworthy Global Computing, 2010. ,
DOI : 10.1007/978-3-642-15640-3_7
Trust in Anonymity Networks, Lecture Notes in Computer Science, vol.6269, pp.48-70, 2010. ,
DOI : 10.1007/978-3-642-15375-4_5
URL : https://hal.archives-ouvertes.fr/hal-00760437
Trustme: Anonymous management of trust relationships in decentralized P2P systems, Peer-to-Peer Computing, pp.142-149, 2003. ,
On the Foundations of Quantitative Information Flow, Lecture Notes in Computer Science, vol.38, issue.1, pp.288-302, 2009. ,
DOI : 10.1137/060651380
Towards an Analysis of Onion Routing Security, INTERNATIONAL WORKSHOP ON DESIGNING PRIVACY ENHANCING TECHNOLOGIES: DE- SIGN ISSUES IN ANONYMITY AND UNOBSERVABILITY, pp.96-114, 2001. ,
DOI : 10.1007/3-540-44702-4_6
Anonymous connections and onion routing, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097), pp.44-54, 1997. ,
DOI : 10.1109/SECPRI.1997.601314
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.3883
Network Flow Watermarking Attack on Low-Latency Anonymous Communication Systems, 2007 IEEE Symposium on Security and Privacy (SP '07), pp.116-130, 2007. ,
DOI : 10.1109/SP.2007.30
Trust and reputation model in peer-to-peer networks, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003), 2003. ,
DOI : 10.1109/PTP.2003.1231515
Design principles for low latency anonymous network systems secure against timing attacks, Proc. Fifth Australasian Information Security Workshop (Privacy Enhancing Technologies), AISW 2007, pp.183-191, 2007. ,