STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A general completeness theorem for two party games
STOC '91 Proceedings of the twenty-third 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
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A practical approach to solve Secure Multi-party Computation problems
Proceedings of the 2002 workshop on New security paradigms
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
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Secure two-party k-means clustering
Proceedings of the 14th ACM conference on Computer and communications security
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Privacy-preserving collaborative recommender systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Hi-index | 0.00 |
There is a fair amount of research about privacy, but few empirical studies about its cost have been conducted. In the area of secure multiparty computation, the scalar product has long been reckoned as one of the most promising alternatives to classic logic gates. The reason for this is that the scalar product is not only complete, which is as good as logic gates, but also much more efficient than logic gates. As a result, we set out to study the computation and communication resources needed for some of the most well-known and frequently referenced secure scalar product protocols, including the composite residuosity, the invertible matrix, the polynomial sharing, and the commodity-based approaches. In addition to the implementation details of these approaches, we analyze and compare their execution time, computation time, and memory and random number consumption. Moreover, Fairplay, the benchmark approach that implements Yao's circuit evaluation protocol, is also included in our experiments in order to demonstrate the potential for the scalar products to replace logic gates.