Point-based trust: Define how much privacy is worth

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

Volumn 4307 LNCS, Issue , 2006, Pages 190-209

  Yao, Danfeng ^a   Frikken, Keith B ^b   Atallah, Mikhail J ^c   Tamassia, Roberto ^a  

^a Brown Univerity   (United States)

^b MIAMI UNIVERSITY   (United States)

^c Purdue University   (United States)

Author keywords

Knapsack problem; Private multi party computation; Trust management

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

KNAPSACK PROBLEMS; MULTIPARTY COMPUTATION; POINT-BASED; PRIVATE INFORMATION; TRUST MANAGEMENT;

COMBINATORIAL OPTIMIZATION;

EID: 78349255568     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935308_14     Document Type: Conference Paper

References (46)

1. M. J.Atallah and W. Du.Securemulti-party computational geometry. In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS’01), volume 2125 ofLecture Notes in Computer Science, pages 165–179, 2001.
2. M. J.Atallah and J.Li. Secure outsourcing of sequence comparisons. In 4th Workshop on Privacy Enhancing Technologies (PET), volume 3424 ofLecture Notes in Computer Science, pages 63–78, 2004.
3. M.Ben-OrandA.Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In The Twentieth Annual ACM Symposium on Theory of Computing (STOC), pages 1–10. ACM Press, 1988.
4. T.Beth, M.Borcherding, and B.Klein. Valuation of trust in open networks. In Proceedings of the Third European Symposium on Research in Computer Security (ESORICS’94), pages 3–18, November 1994.
5. P. A.Bonatti and P.Samarati.A uniform framework for regulating service access and information release on the web. Journal of Computer Security, 10(3):241–272, 2002.
6. D.Boneh and M.Franklin. Identity-Based Encryption from the Weil Pairing. In Proceedings of Crypto 2001, volume 2139 of Lecture Notes in Computer Science, pages 213–229. Springer, 2001.
7. R.Bradshaw, J.Holt, and K.Seamons.Concealing complex policies with hidden credentials. In Proceedings of 11th ACM Conference on Computer and Communications Security (CCS), Oct. 2004.
8. J.Camenisch and E.Van Herreweghen.Design and implementation of the idemix anonymous credential system. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS), pages21–30, 2002.
9. R.Canetti.Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143–202, 2000.
10. D.Chaum.Security without identification: transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030–1044, October1985.
11. D.Chaum, C.Crépeau, and I.Damgard. Multiparty unconditionally secure protocols. In The twentieth annual ACM Symposium on Theory of Computing (STOC), pages 11–19. ACM Press, 1988.
12. D.Chaum and J.-H.Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In Proceedings of Advances in cryptology— CRYPTO’86, pages 118–167, January 1987.
13. W.Chen, L.Clarke, J.Kurose, and D.Towsley.Optimizing cost-sensitive trust-negotiation protocols. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 2, pages1431–1442, 2005.
14. C.Cocks. An identity based encryption scheme based on quadratic residues. In 8th IMA International Conference on Cryptography and Coding, volume 2260, pages 360–363. Springer, Dec. 2001.
15. T. H.Cormen, C. E.Leiserson, R. L.Rivest, and C.Stein. Introduction to algorithms. MIT Press, 2001.
16. I.Damgård and M.Jurik. A generalisation, a simplification and some applications of Pail-lier’s probabilistic public-key system. In 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC’01), LNCS 1992, pages 119–136, 2001.
17. E.Damiani, S.De Capitanidi Vimercati, S.Paraboschi, P. Samarati, and F. Violante. A reputation-based approach for choosing reliable resources in peer-to-peer networks. In ACM Conference on Computer and Communications Security (CCS’02), pages 207–216, 2002.
18. W. Du. A study of several specific secure two-party computation problems, 2001. PhD thesis, Purdue University, West Lafayette, Indiana.
19. M.Freedman, K.Nissim, and B.Pinkas. Efficient private matching and set intersection. In Advances in Cryptology – Eurocrypt’04, volume 3027 of LNCS, pages 1–19. Springer-Verlag, May2004.
20. K. B.Frikken and M. J.Atallah. Privacy preserving route planning. In Proceedings of the 2004 ACM workshop on Privacy in the Electronic Society (WPES), pages 8–15. ACM Press, 2004.
21. K. B.Frikken, M. J.Atallah, and J.Li.Hidden access control policies with hidden credentials. In Proceedings of the 3nd ACM Workshop on Privacy in the Electronic Society (WPES), Oct. 2004.
22. K. B.Frikken, J.Li, and M. J.Atallah. Trust negotiation with hidden credentials, hidden policies, and policy cycles. In Proceedings of the 13th Annual Network and Distributed System Security Symposium (NDSS), 2006.
23. O.Goldreich. Secure multi-party computation, Oct. 2002. Unpublished Manuscript.
24. O.Goldreich. The Foundations of Cryptography, volume 2. Cambridge University Press, 2004.
25. O.Goldreich, S.Micali, and A.Wigderson. How to play any mental game. In The nineteenth annual ACM conference on theory of computing, pages 218–229. ACM Press, 1987.
26. S.Goldwasser, S.Micali, and C.Rackoff.The knowledge complexity of interactive proof-systems. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing (STOC), pages291–304, 1985.
27. M.Gruteser and D.Grunwald.Anonymous usage of location-based services through spatial and temporal cloaking. In ACM/USENIX International Conference on Mobile Systems, Applications, and Services (MobiSys), 2003.
28. J. E.Holt, R. W.Bradshaw, K. E.Seamons, and H.Orman.Hidden credentials. In Proceedings of the 2nd ACM Workshop on Privacy in the Electronic Society (WPES), Oct. 2003.
29. Q.Huang, D.Jao, and H. J.Wang.Applications of secure electronic voting to automated privacy-preserving troubleshooting. In Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS), November2005.
30. G.Jagannathan and R. N.Wright.Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In Proceeding of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pages593–599, 2005.
31. L.Kissner and D.Song. Private and threshold set-intersection. In Advances in Cryptology – CRYPTO’05, August2005.
32. J.Li, N.Li, and W. H.Winsborough.Automated trust negotiation using cryptographic credentials. In Proceedings of 12th ACM Conference on Computer and Communications Security (CCS), pages 46–57, 2005.
33. H.Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In Advances in Cryptology — Asiacrypt’03, LNCS, pages 416–433, 2003.
34. P.Paillier. Public-key cryptosystems based on composite degree residuosity classes. Advances in Cryptology – EUROCRYPT 1999, LNCS1592:223–238, 1999.
35. A.Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology – Crypto’84, volume 196 of Lecture Notes in Computer Science, pages 47–53. Springer, 1984.
36. H.Tran, M.Hitchens, V.Varadharajan, and P.Watters. A trust based access control framework for P2P file-sharing systems. In Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS’05) - Track 9, page 302c. IEEE ComputerSociety, 2005.
37. W. H.Winsborough and N.Li.Safety in automated trust negotiation. In Proceedings of IEEE Symposium on Security and Privacy. IEEE Computer Society Press, May2004.
38. W. H.Winsborough, K. E.Seamons, and V. E.Jones. Automated trust negotiation. In DARPA Information Survivability Conference and Exposition, volume I, pages 88–102. IEEE Press, Jan. 2000.
39. N.Yankelovich, W.Walker, P.Roberts, M.Wessler, J.Kaplan, and J.Provino. Meeting central: making distributed meetings more effective. In Proceedings of the 2004 ACM Conference on Computer Supported Cooperative Work (CSCW’04), pages 419–428, New York, NY, USA, 2004. ACM Press.
40. A. C.Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162–167. IEEE Computer Society Press, 1986.
41. D. Yao, K. B. Frikken, M. J. Atallah, and R. Tamassia. Flexible, secure and private point-based trust management, November2005. Technical Report. Brown University.
42. D.Yao, R.Tamassia, and S.Proctor. Privacy-preserving computation of trust with application to fuzzy location queries, March 2006. Brown University Technical Report.
43. T.Yu, X.Ma, and M.Winslett.PRUNES: An efficient and complete strategy for automated trust negotiation over the internet. In Proceedings of the ACM Conference on Computer and Communications Security (CCS), pages210–219, November2000.
44. T.Yu and M.Winslett. A unified scheme for resource protection in automated trust negotiation. In Proceedings of IEEE Symposium on Security and Privacy, pages 110–122. IEEE Computer Society Press, May2003.
45. T.Yu, M.Winslett, and K. E.Seamons. Interoperable strategies in automated trust negotiation. In Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS’01), pages 146–155. ACM Press, Nov. 2001.
46. C.Zouridaki, B. L.Mark, M.Hejmo, and R. K.Thomas. A quantitative trust establishment framework for reliable data packet delivery in MANETs. In V. Atluri, P. Ning, and W. Du, editors, Proceedings of the Third ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), pages 1–10. ACM, 2005.