Anonymous webs of trust

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6205 LNCS, Issue , 2010, Pages 130-148

  Backes, Michael ^a,b   Lorenz, Stefan ^a   Maffei, Matteo ^a   Pecina, Kim ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CERTIFICATE CHAINS; CRYPTOGRAPHIC PROTOCOLS; FORMAL VERIFICATIONS; KEY ATTRIBUTES; PROTOTYPICAL IMPLEMENTATION; PUBLIC KEYS; TRUST LEVEL; TRUST RELATIONSHIP; ZERO KNOWLEDGE PROOF;

CRYPTOGRAPHY;

AUTHENTICATION;

EID: 77955437955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14527-8_8     Document Type: Conference Paper

References (41)

1. Abadi, M., Blanchet, B.: Secrecy types for asymmetric communication. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 25-41. Springer, Heidelberg (2001)
2. Abadi, M., Blanchet, B., Fournet, C.: Automated verification of selected equivalences for security protocols. In: LICS 2005, pp. 331-340. IEEE, Los Alamitos (2005)
3. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL 2001, pp. 104-115. ACM, New York (2001)
4. Ashri, R., Ramchurn, S. D., Sabater, J., Luck, M., Jennings, N. R.: Trust evaluation through relationship analysis. In: AAMAS 2005, pp. 1005-1011. ACM, New York (2005)
5. Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255-270. Springer, Heidelberg (2000)
6. Backes, M., Lorenz, S., Maffei, M., Pecina, K.: Anonymous webs of trust (tool and long version) (2010), http://www.lbs.cs.uni-sb.de/awot/
7. Backes, M., Maffei, M., Unruh, D.: Zero-knowledge in the applied pi-calculus and automated verification of the direct anonymous attestation protocol. In: SSP 2008, pp. 202-215. IEEE, Los Alamitos (2008)
8. Backes, M., Unruh, D.: Computational soundness of symbolic zero-knowledge proofs against active attackers. In: CSF 2008, pp. 255-269. IEEE, Los Alamitos (2008)
9. Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., Shacham, H.: Randomizable proofs and delegatable anonymous credentials. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 108-125. Springer, Heidelberg (2009)
10. Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: The case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, Springer, Heidelberg (2005)
11. Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: CSFW 2001, pp. 82-96. IEEE, Los Alamitos (2001)
12. Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440-456. Springer, Heidelberg (2005)
13. Callas, J., Donnerhacke, L., Finney, H., Shaw, D., Thayer, R.: OpenPGP message format. In: Request for Comments. IETF, vol. 4880 (2007)
14. Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268-289. Springer, Heidelberg (2003)
15. Camenisch, J., Michels, M.: Proving in zero-knowledge that a number is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 107-122. Springer, Heidelberg (1999)
16. Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B. S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410-424. Springer, Heidelberg (1997)
17. Carminati, B., Ferrari, E., Perego, A.: Rule-based access control for social networks. In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM 2006 Workshops. LNCS, vol. 4278, pp. 1734-1744. Springer, Heidelberg (2006)
18. Caronni, G.: Walking the web of trust. In: WETICE 2000, pp. 153-158. IEEE, Los Alamitos (2000)
19. Chaum, D., van Heyst, E.: Group signatures. In: Davies, D. W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257-265. Springer, Heidelberg (1991)
20. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y. G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174-187. Springer, Heidelberg (1994)
21. Domingo-Ferrer, J., Viejo, A., Sebé, F., González- Nicolás, U.: Privacy homomorphisms for social networks with private relationships. Computer Networks 52 (15), 3007-3016 (2008)
22. Domingo-Ferror, J.: A public-key protocol for social networks with private relationships. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds.) MDAI 2007. LNCS (LNAI), vol. 4617, pp. 373-379. Springer, Heidelberg (2007)
23. facebook, http://www.facebook.com/
24. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A. M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
25. Frikken, K., Srinivas, P.: Key allocation schemes for private social networks. In: WPES 2009, pp. 11-20. ACM, New York (2009)
26. Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B. S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16-30. Springer, Heidelberg (1997)
27. Gentry, C., Silverberg, A.: Hierarchical id-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548-566. Springer, Heidelberg (2002)
28. Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)
29. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38 (3), 690-728 (1991)
30. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18 (1), 186-208 (1989)
31. Herranz, J.: Identity-based ring signatures from rsa. Theoretical Computer Science 389 (1- 2), 100-117 (2007)
32. Cottrell, L., Cypher, P., Finney, H., Goldberg, I., Laurie, B., Plumb, C., or Young, E.: Signing as one member of a set of keys, http://www.abditum. com/ringsig/
33. Pedersen, T. P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129-140. Springer, Heidelberg (1992)
34. Rivest, R. L., Shamir, A., Tauman, Y.: How to leak a secret. Communications of the ACM 22 (22), 612-613 (2001)
35. Sabater-Mir, J.: Towards the next generation of computational trust and reputation models. In: Torra, V., Narukawa, Y., Valls, A., Domingo-Ferrer, J. (eds.) MDAI 2006. LNCS (LNAI), vol. 3885, pp. 19-21. Springer, Heidelberg (2006)
36. Scott, M.: Multiprecision Integer and Rational Arithmetic C/C++ Library, http://www.shamus.ie/
37. Song, D. X.: Practical forward secure group signature schemes. In: CCS 2001, pp. 225-234. ACM, New York (2001)
38. The GNU Privacy Guard Team. GnuPG, http://www.gnupg.org/
39. The GNU Privacy Guard Team. The GNU Privacy Handbook, http://www.gnupg.org/gph/en/manual.pdf
40. Tootoonchian, A., Saroiu, S., Ganjali, Y., Wolman, A.: Lockr: better privacy for social networks. In: CoNEXT 2009, pp. 169-180. ACM, New York (2009)
41. Wang, D.-W., Liau, C.-J., Hsu, T.-S.: Privacy protection in social network data disclosure based on granular computing. In: Fuzzy 2006, pp. 997-1003. IEEE, Los Alamitos (2006)