Exploiting social networks for threshold signing: Attack-resilience vs. availability

Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08

Volumn , Issue , 2008, Pages 325-336

  Xu, Shouhuai ^a   Li, Xiaohu ^a   Parker, Paul ^a  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Attack resilience; Availability; Social networks; Threshold cryptography; Threshold signing

Indexed keywords

CRYPTOGRAPHIC KEY; DIGITAL SIGNATURE; NON-REPUDIATION; PEER TO PEER; SECURITY MECHANISM; SIGNING KEY; SOCIAL NETWORKS; THRESHOLD CRYPTOGRAPHY;

COMPUTER CRIME; KEYS (FOR LOCKS); NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY; SOCIAL NETWORKING (ONLINE);

PEER TO PEER NETWORKS;

EID: 77952350757     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1368310.1368358     Document Type: Conference Paper

References (38)

1. R. Albert and A. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47-97, 2002.
2. R. Albert, H. Jeong, and A. Barabasi. Error and attack tolerance of complex networks. Nature, 406:378-482, 2000.
3. N. Alon. Spectral techniques in graph algorithms. In Proceedings of LATIN'98, pages 206-215.
4. R. Anderson. On the forward security of digital signatures. Technical report, 1997.
5. M. Bellare and S. Miner. A forward-secure digital signature scheme. In Proc. CRYPTO 1999, pages 431-448.
6. D. Boneh, X. Ding, G. Tsudik, and M. Wong. A method for fast revocation of public key certificates and security capabilities. In Proc. USENIX Security Symposium, pages 297-308, 2001.
7. S. Capkun, L. Buttyan, and J. Hubaux. Small worlds in security systems: an analysis of the pgp certificate graph. In Proc. NSPW'02, pages 28-35.
8. L. Costa, F. Rodrigues, G. Travieso, and P. Boas. Characterization of complex networks: A survey of measurements. Advances In Physics, 56:167-242, 2007.
9. Y. Dodis, J. Katz, S. Xu, and M. Yung. Strong key-insulated signature schemes. In Public Key Cryptography (PKC'03), pages 130-144.
10. W. Ford and B. Kaliski Jr. Server-assisted generation of a strong secret from a password. In 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE'00), pages 176-180, 2000.
11. R. Ganesan. Yaksha: augmenting kerberos with public key cryptography. In Proc. NDSS'95, 1995.
12. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold dss signatures. In EUROCRYPT'96, pages 354-371, 1996.
13. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17 (2):281-308, April 1988.
14. Trusted Computing Group. https://www.trustedcomputinggroup.org/.
15. K. Harrison and S. Xu. Protecting cryptographic keys from memory disclosures attacks. In Proc. IEEE DSN'07, pages 137-143, 2007.
16. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public key and signature schemes. In Proc. ACM CCS, pages 100-110. 1997.
17. D. Hoover and B. Kausik. Software smart cards via cryptographic camouflage. In IEEE Symposium on Security and Privacy, pages 208-215, 1999.
18. G. Itkis and L. Reyzin. Sibir: Signer-base intrusion-resilient signatures. In M. Yung, editor, Proc. CRYPTO 2002, pages 499-514.
19. P. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Proc. CRYPTO 96, pages 104-113.
20. P. MacKenzie and M. Reiter. Networked cryptographic devices resilient to capture. In IEEE Symposium on Security and Privacy, pages 12-25, 2001.
21. P. MacKenzie and M. Reiter. Two-party generation of dsa signatures. In Proc. CRYPTO 2001, pages 137-154.
22. A. Medina, A. Lakhina, I. Matta, and J. Byers. Brite: An approach to universal topology generation. In Proceedings of International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'01), pages 346-356.
23. National Institute of Standards and Technology (NIST). FIPS Publication 186: Digital Signature Standard, May 19, 1994.
24. M. Newman. The structure and function of complex networks. SIAM Review, 45:167, 2003.
25. A. Nicolosi, M. Krohn, Y. Dodis, and D. Mazières. Proactive two-party signatures for user authentication. In Proceedings of the Network and Distributed System Security Symposium (NDSS'03), 2003.
26. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks (extended abstract). In Proc. ACM PODC'91, pages 51-59.
27. R. Perlman and C. Kaufman. Secure password-based protocol for downloading a private key. In Proceedings of the Network and Distributed System Security Symposium (NDSS'99), 1999.
28. D. Piegdon and L. Pimenidis. Hacking in physically adressable memory. In Proc. 4th International Conference on Detection of Intrusions & Malware, and Vulnerability Assessment (DIMVA'07).
29. T. Rabin. A simplified approach to threshold and proactive rsa. In CRYPTO'98, pages 89-104.
30. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. C. ACM, 21 (2):120-126, 1978.
31. S. Ross. Stochastic Processes. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, Inc, 1996.
32. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161-174, 1991.
33. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, November 1979.
34. A. Shamir and N. van Someren. Playing 'hide and seek' with stored keys. In Proceedings of Financial Cryptography 1999, pages 118-124.
35. S. Xu, X. Li, and P. Parker. Exploiting social networks for threshold signing: Attack-resilience vs. availability. Full version of the present paper available at http://www.cs.utsa.edu/∼shxu.
36. S. Xu and R. Sandhu. Two efficient and provably secure schemes for server-assisted threshold signatures. In Proc. CT-RSA 2003, pages 355-372.
37. B. Yee. Using secure coprocessors. PhD thesis, Carnegie Mellon University, May 1994.
38. H. Yu, M. Kaminsky, P. Gibbons, and A. Flaxman. Sybilguard: defending against sybil attacks via social networks. In Proceedings of the ACM SIGCOMM 2006, pages 267-278, 2006.