Zero-knowledge test of vector equivalence and granulation of user data with privacy

2006 IEEE International Conference on Granular Computing

Volumn , Issue , 2006, Pages 720-725

  Duan, Yitao ^a   Canny, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Equivalence test; Granulation; Privacy; Zero knowledge protocol

Indexed keywords

EQUIVALENCE TESTS; ZERO KNOWLEDGE PROTOCOL;

COMPUTATION THEORY; DATA MINING; DATA PRIVACY; DATA STRUCTURES; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

PARALLEL PROCESSING SYSTEMS;

EID: 33751096728     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data. Norwell, MA, USA: Kluwer Academic Publishers, 1992.
2. Y. Y. Yao and N. Zhong, "Granular computing using information tables," pp. 102-124, 2002.
3. J. F. Canny and Y. Duan, "Practical private computation of vector addition-based functions or: Can privacy be for free?" EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-12, February 8 2006. [Online]. Available: http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS- 2006-12.html
4. L. A. Zadeh, "Fuzzy sets and information granularity," pp. 3-18, 1979.
5. T. Y. Lin, "Granular computing, announcement of the bisc special interest group on granular computing," 1997.
6. Z. Pawlak, "Reasoning about data - a rough set perspective," in RSCTC '98: Proceedings of the First International Conference on Rough Sets and Current Trends in Computing. London, UK: Springer-Verlag, 1998, pp. 25-34.
7. T. Y. Lin, "Granular computing on binary relations," in TSCTC '02: Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing. London, UK: Springer-Verlag, 2002, pp. 296-299.
8. A. Skowron, "Toward intelligent systems: Calculi of information granules," in Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence. London, UK: Springer-Verlag, 2001, pp. 251-260.
9. Y. Y. Yao, "A partition model of granular computing," LNCS Transactions on Rough Sets, vol. 1, pp. 232-253, 2004.
10. Y. Y. Yao and C.-J. Liau, "A generalized decision logic language for granular computing," in FUZZ-IEEE'02: The 2002 IEEE World Congress on Computational Intelligence, 2002, pp. 1092-1097.
11. A. C.-C. Yao, "Protocols for secure computations," in FOCS '82. IEEE, 1982, pp. 160-164.
12. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game -a completeness theorem for protocols with honest majority," in Proceedings of the 19th ACM Symposium on the Theory of Computing (STOC), 1987, pp. 218-229.
13. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88. ACM, May 2-4 1988, pp. 1-10.
14. O. Goldreich, "Secure multi-party computation," Working Draft, 2000. [Online]. Available: citeseer.nj.nec.com/goldreich98secure.html
15. D. Beaver and S. Goldwasser, "Multiparty computation with faulty majority," in Proceedings of Advances in Cryptology - CRYPTO '89, ser. Lecture Notes in Computer Science, vol. 435. Springer-Verlag, 1989, p. 589.
16. S. Goldwasser and L. Levin, "Fair computation of general functions in presence of immoral majority," in Advances in Cryptology - CRYPTO '90, ser. Lecture Notes in Computer Science, vol. 537. Springer-Verlag, 1991, pp. 77-93.
17. J. Canny, "Collaborative filtering with privacy," in IEEE Symposium on Security and Privacy, Oakland, CA, May 2002, pp. 45-57. [Online]. Available: http://citeseer.nj.nec.com/canny02collaborative.html
18. T. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," in Advances in Cryptology - CRYPTO '91, ser. Lecture Notes in Computer Science, vol. 576. Springer-Verlag, 1991, pp. 129-140.
19. R. Cramer and I. Damgård, "Zero-knowledge proof for finite field arithmetic, or: Can zero-knowledge be for free?" in CRYPTO '98, ser. Lecture Notes in Computer Science, vol. 1642. Springer-Verlag, 1998.
20. J. Markus and J. Ari, "Millimix: Mixing in small batches," Tech. Rep., 1999.
21. R. Gennaro, M. O. Rabin, and T. Rabin, "Simplified vss and fast-track multiparty computations with applications to threshold cryptography," in PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing. ACM Press, 1998, pp. 101-111.