Privacy-preserving credit checking

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2005, Pages 147-154

  Frikken, Keith ^a   Atallah, Mikhail ^a   Zhang, Chen ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

E commerce; Privacy; Secure multi party computation; Secure protocol

Indexed keywords

PRIVACY; SECURE MULTI-PARTY COMPUTATION; SECURE PROTOCOL;

ELECTRONIC COMMERCE; FINANCE; INFORMATION ANALYSIS; NETWORK PROTOCOLS; SECURITY OF DATA;

DATA PRIVACY;

EID: 30044439511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064009.1064025     Document Type: Conference Paper

References (20)

1. Equifax. http://www.equifax.com
2. Experian. http://www.experian.com
3. TransUnion. http://www.transunion.com
4. Michael Ben-Or and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 1-10. ACM Press, 1988.
5. R. Canetti, Y. Ishai, R. Kumar, M. Reiter, R. Rubinfeld, and R. Wright. Selective private function evaluation with applications to private statistics, 2001.
6. David Chaum, Claude Crépeau, and Ivan Damgard. Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 11-19. ACM Press, 1988.
7. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 218-229. ACM Press, 1987.
8. Oded Goldreich. Secure multi-party computation. Working Draft, 2000.
9. Shafi Goldwasser. Multi party computations: past and present. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pages 1-6. ACM Press, 1997.
10. Jason E. Holt, Robert W. Bradshaw, Kent E. Seamons, and Hilarie Orman. Hidden credentials. In Proceedings of the 2nd ACM Workshop on Privacy in the Electronic Society, October 2003.
11. J. Katz and R. Ostrovsky. Round optimal secure two-party computation. In CRYPTO 04, 2004.
12. Ninghui Li, Wenliang Du, and Dan Boneh. Oblivious signature-based envelope. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003). ACM Press, July 2003.
13. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In Proceedings of Usenix Security, 2004.
14. Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 245-254. ACM Press, 1999.
15. Moni Naor and Benny Pinkas. Efficient oblivious transfer protocols. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 448-457. Society for Industrial and Applied Mathematics, 2001.
16. Moni Naor, Benny Pinkas, and Reuban Sumner. Privacy preserving auctions and mechanism design. In EC '99: Proceedings of the 1st ACM conference on Electronic commerce, pages 129-139. ACM Press, 1999.
17. P. Rogaway. The Round Complexity of Secure Protocols. Ph.d. thesis, MIT, 1991. Available at http://www.cs.ucdavis.edu/rogaway/papers.
18. Bruce Schneier. Applied Cryptography - Protocols, algorithms, and souce code in C. John Wiley & Sons, Inc., 1996.
19. A.C Yao. Protocols for secure computation. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982.
20. A.C Yao. How to generate and exchange secrets. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.