Private policy negotiation

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

Volumn 4107 LNCS, Issue , 2006, Pages 81-95

  Kursawe, Klaus ^a,b   Neven, Gregory ^a,c   Tuyls, Pim ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMMUNICATION CHANNELS (INFORMATION THEORY); CRYPTOGRAPHY; DATA HANDLING; NETWORK PROTOCOLS; PUBLIC POLICY;

HIGH BANDWIDTH COMMUNICATION CHANNELS; HOMOMORPHIC ENCRYPTION SYSTEMS; PRIVACY PRESERVING POLICY; PRIVACY SENSITIVE DATA;

DATA PRIVACY;

EID: 33750036681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889663_6     Document Type: Conference Paper

References (25)

1. M. Abadi and J. Feigenbaum. Secure circuit evaluation. J. Cryptology, 2(1):1-12, 1990.
2. S. S. Al-Riyami, J. Malone-Lee, and N. P. Smart. Escrow-free encryption supporting cryptographic workflow. Cryptology ePrint Archive, Report 2004/258, 2004. Available from http://eprint.iacr.org/.
3. M. Backes, G. Karjoth, W. Bagga, and M. Schunter. Efficient comparison of enterprise privacy policies. In ACM SAC 2004, pages 375-382, New York, NY, USA, 2004. ACM Press.
4. W. Bagga and R. Molva. Policy-based cryptography and applications. In A. Patrick and M. Yung, editors, Financial Cryptography 2005, volume 3570 of LNCS, pages 72-87. Springer, 2005.
5. A. Barth and J. C. Mitchell. Enterprise privacy promises and enforcement. In WITS '05: Proceedings of the 2005 workshop on Issues in the Theory of Security, pages 58-66. ACM Press, 2005.
6. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-DNF formulas on ciphertexts. In J. Kilian, editor, TCC 2005, volume 3378 of LNCS, pages 325-341. Springer, 2005.
7. J. Camenisch and E. Van Herreweghen. Design and implementation of the idemix anonymous credential system. In Proc. of the 9th CCS, pages 21-30, New York, NY, USA, 2002. ACM Press.
8. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In Proc. of the 18th ACM STOC, pages 364-369. ACM Press, 1986.
9. R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In B. Pfitzmann, editor, EUROCRYPT 2001, volume 2045 of LNCS, pages 280-300. Springer, 2001.
10. I. Damgård and J. B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In D. Boneh, editor, CRYPTO 2003, volume 2729 of LNCS, pages 565-582. Springer, 2003.
11. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In G. Brassard, editor, CRYPTO 1989, volume 435 of LNCS, pages 307-315. Springer, 1990.
12. C. Díaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In R. Dingledine and P. Syverson, editors, PET 2002, volume 2482 of LNCS. Springer, 2002.
13. M. K. Franklin and S. Haber. Joint encryption and message-efficient secure computation. J. Cryptology, 9(4):217-232, 1996.
14. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In C. Cachin and J. Camenisch, editors, EUROCRYPT 2004, volume 3027 of LNCS, pages 1-19. Springer, 2004.
15. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In J. Stern, editor, EUROCRYPT 1999, volume 1592 of LNCS, pages 295-310. Springer, 1999.
16. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure applications of Pedersen's distributed key generation protocol. In M. Joye, editor, CT-RSA 2003, volume 2964 of LNCS, pages 373-390. Springer, 2003.
17. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. of the 19th ACM STOC, pages 218-229. ACM Press, 1987.
18. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, editor, ASIACRYPT 2000, volume 1976 of LNCS, pages 346-358. Springer, 2000.
19. M. C. Mont, S. Pearson, and P. Bramhall. Towards accountable management of identity and privacy: Sticky policies and enforceable tracing services. In DEXA 2003, pages 377-382. IEEE Computer Society, 2003.
20. B. Schoenmakers and P. Tuyls. Practical two-party computation based on the conditional gate. In P. J. Lee, editor, ASIACRYPT 2004, volume 3329 of LNCS, pages 119-136. Springer, 2004.
21. K. E. Seamons, M. Winslett, and T. Yu. Limiting the disclosure of access control policies during automated trust negotiation. In NDSS 2001. The Internet Society, 2001.
22. S. Steinbrecher and S. Köpsell. Modelling unlinkability. In R. Dingledine, editor, PET 2003, volume 2760 of LNCS. Springer, 2003.
23. W3C. The platform for privacy preferences 1.0 (P3P1.0) specification, 2002. http://www.w3.org/TR/P3P/.
24. A. C.-C. Yao. Protocols for secure computations. In IEEE, editor, Proc. of the 23rd FOCS, pages 160-164. IEEE Computer Society Press, 1982.
25. T. Yu, M. Winslett, and K. E. Seamons. Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation. ACM Trans. Inf. Syst. Secur., 6:1-42, 2003.