A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Computationally private information retrieval (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
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Communications of the ACM
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Some Recent Research Aspects of Threshold Cryptography
ISW '97 Proceedings of the First International Workshop on Information Security
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
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
Secure Multi-party Computational Geometry
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Tools for privacy preserving distributed data mining
ACM SIGKDD Explorations Newsletter
A practical approach to solve Secure Multi-party Computation problems
Proceedings of the 2002 workshop on New security paradigms
Leveraging the "Multi" in secure multi-party computation
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Private collaborative forecasting and benchmarking
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
A study of secure multi-party elementary function computation protocols
InfoSecu '04 Proceedings of the 3rd international conference on Information security
Distributed oblivious function evaluation and its applications
Journal of Computer Science and Technology
Secure two-party computational geometry
Journal of Computer Science and Technology
A privacy-preserving protocol for neural-network-based computation
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Secure set intersection cardinality with application to association rule mining
Journal of Computer Security
Information Sciences: an International Journal
Privacy-preserving technology and its applications in statistics measurements
Proceedings of the 2nd international conference on Scalable information systems
Secure Computation for Privacy Preserving Biometric Data Retrieval and Authentication
EuroISI '08 Proceedings of the 1st European Conference on Intelligence and Security Informatics
Privacy-preserving linear programming
Proceedings of the 2009 ACM symposium on Applied Computing
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
BTAS'09 Proceedings of the 3rd IEEE international conference on Biometrics: Theory, applications and systems
Composite signal representation for fast and storage-efficient processing of encrypted signals
IEEE Transactions on Information Forensics and Security
Efficient distributed linear programming with limited disclosure
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Privacy-Preserving graph algorithms in the semi-honest model
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Protocol to compute polygon intersection in STC model
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Secure and efficient distributed linear programming
Journal of Computer Security - DBSec 2011
| Hi-index | 0.00 |
Abstract: The growth of the Internet has triggered tremendous opportunities for cooperative computation, in which multiple parties need to jointly conduct computation tasks based on the private inputs they each supply. These computations could occur between mutually untrusted parties, or even between competitors. For example, two competing financial organizations might jointly invest in a project that must satisfy both organizations' private and valuable constraints. Today, to conduct such a computation, one must usually know the inputs from all the participants; however if nobody can be trusted enough to know all the inputs, privacy will become a primary concern. Linear systems of equations problem and linear least-square problem problems are two important scientific computations that involve linear equations. Solutions to these problems are widely used in many areas such as banking, manufacturing, and telecommunications. However, the existing solutions do not extend to the privacy-preserving cooperative computation situation, in which the linear equations are shared by multiple parties, who do not want to disclose their data to the other parties. In this paper, we formally define these specific privacy-preserving cooperative computation problems, and present protocols to solve them.