A randomized protocol for signing contracts
Communications of the ACM
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
Dummynet: a simple approach to the evaluation of network protocols
ACM SIGCOMM Computer Communication Review
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Communications of the ACM
Distributed Algorithms
Verifiable secret-ballot elections
Verifiable secret-ballot elections
Private collaborative forecasting and benchmarking
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Privacy-preserving remote diagnostics
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
Towards Practical Privacy for Genomic Computation
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Filtering for private collaborative benchmarking
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
A practical implementation of secure auctions based on multiparty integer computation
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Privacy-preserving computation of benchmarks on item-level data using RFID
Proceedings of the third ACM conference on Wireless network security
An access control model for mobile physical objects
Proceedings of the 15th ACM symposium on Access control models and technologies
Privacy-preserving multi-objective evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Privacy-preserving pattern matching for anomaly detection in RFID anti-counterfeiting
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Securely disseminating RFID events
Proceedings of the 5th ACM international conference on Distributed event-based system
Expression rewriting for optimizing secure computation
Proceedings of the third ACM conference on Data and application security and privacy
Secure benchmarking in the cloud
Proceedings of the 18th ACM symposium on Access control models and technologies
Efficient secure computation optimization
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
| Hi-index | 0.00 |
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental study of a specific protocol for a real-world sized problem under realistic conditions and it suggests that the practical performance of the protocol is almost independent of the network performance. We argue that our result can be generalized to a whole class of SMC protocols.