STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Commodity-based cryptography (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Universal service-providers for database private information retrieval (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the 1998 workshop on New security paradigms
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Selective private function evaluation with applications to private statistics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Privacy-Preserving Cooperative Statistical Analysis
ACSAC '01 Proceedings of the 17th Annual Computer Security Applications Conference
Privacy-Preserving Cooperative Scientific Computations
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A study of several specific secure two-party computation problems
A study of several specific secure two-party computation problems
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Building decision tree classifier on private data
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
Leveraging the "Multi" in secure multi-party computation
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
A new permutation approach for distributed association rule mining
Proceedings of the 14th ACM international conference on Information and knowledge management
L-diversity: Privacy beyond k-anonymity
ACM Transactions on Knowledge Discovery from Data (TKDD)
Privacy-preserving collision detection of two circles
Proceedings of the 2nd international conference on Scalable information systems
Preservation of Privacy in Thwarting the Ballot Stuffing Scheme
TrustBus '08 Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business
Secure two-party point-circle inclusion problem
Journal of Computer Science and Technology
Secure Multi-party Computation Using Virtual Parties for Computation on Encrypted Data
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Toward empirical aspects of secure scalar product
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews - Special issue on information reuse and integration
Louis, Lester and Pierre: three protocols for location privacy
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Privacy-preserving collaborative recommender systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Privacy-preserving applications on smartphones
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in security
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
A privacy preserving system for friend locator applications
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Information theoretical analysis of two-party secret computation
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Secrecy of two-party secure computation
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Location privacy for cellular systems; analysis and solution
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Privacy preserving monitoring and surveillance in sensor networks
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
On the (Im)possibility of privately outsourcing linear programming
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Hi-index | 0.00 |
Secure Multi-party Computation (SMC) problems deal with the following situation: Two (or many) parties want to jointly perform a computation. Each party needs to contribute its private input to this computation, but no party should disclose its private inputs to the other parties, or to any third party. With the proliferation of the Internet, SMC problems becomes more and more important. So far no practical solution has emerged, largely because SMC studies have been focusing on zero information disclosure, an ideal security model that is expensive to achieve.Aiming at developing practical solutions to SMC problems, we propose a new paradigm, in which we use an acceptable security model that allows partial information disclosure. Our conjecture is that by lowering the restriction on the security, we can achieve a much better performance. The paradigm is motivated by the observation that in practice people do accept a less secure but much more efficient solution because sometimes disclosing information about their private data to certain degree is a risk that many people would rather take if the performance gain is so significant. Moreover, in our paradigm, the security is adjustable, such that users can adjust the level of security based on their definition of the acceptable security. We have developed a number of techniques under this new paradigm, and are currently conducting extensive studies based on this new paradigm.