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
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Secure Multi-party Computation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
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
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Threshold Cryptosystems Based on Factoring
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Client/Server Tradeoffs for Online Elections
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Extractable Perfectly One-Way Functions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Asynchronous Multi-Party Computation with Quadratic Communication
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Privacy Preserving Computations without Public Key Cryptographic Operation
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Masked Ballot Voting for Receipt-Free Online Elections
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
A Design of Secure Preferential E-Voting
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Privacy-Preserving Face Recognition
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Secure Multi-party Computation Minimizing Online Rounds
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Oblivious Multi-variate Polynomial Evaluation
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Encrypted domain DCT based on homomorphic cryptosystems
EURASIP Journal on Information Security - Special issue on enhancing privacy protection in multimedia systems
On the theoretical gap between synchronous and asynchronous MPC protocols
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Multiparty computation for dishonest majority: from passive to active security at low cost
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Linear, constant-rounds bit-decomposition
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Improved primitives for secure multiparty integer computation
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Practicalization of a range test and its application to e-auction
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Identification schemes of proofs of ability secure against concurrent man-in-the-middle attacks
ProvSec'10 Proceedings of the 4th international conference on Provable security
Efficient privacy-preserving data mining in malicious model
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Privacy-preserving data mining in presence of covert adversaries
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Fair and privacy-preserving multi-party protocols for reconciling ordered input sets
ISC'10 Proceedings of the 13th international conference on Information security
Distributed paillier cryptosystem without trusted dealer
WISA'10 Proceedings of the 11th international conference on Information security applications
Sub-linear, secure comparison with two non-colluding parties
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Secure data structures based on multi-party computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Quadratic error minimization in a distributed environment with privacy preserving
PSDML'10 Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning
Semi-homomorphic encryption and multiparty computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Secure E-auction for mobile users with low-capability devices in wireless network
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
Identification schemes from key encapsulation mechanisms
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Benaloh's dense probabilistic encryption revisited
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Privacy-preserving data mining: a game-theoretic approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Secure and efficient protocols for iris and fingerprint identification
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Efficient protocols for privacy preserving matching against distributed datasets
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A round and communication efficient secure ranking protocol
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Share conversion, pseudorandom secret-sharing and applications to secure computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Cryptographic asynchronous multi-party computation with optimal resilience
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Ciphertext comparison, a new solution to the millionaire problem
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Modulo reduction for paillier encryptions and application to secure statistical analysis
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Perfectly secure multiparty computation and the computational overhead of cryptography
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Hybrid approach for secure mobile agent computations
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data 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
Robust multiparty computation with linear communication complexity
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On combining privacy with guaranteed output delivery in secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Scalable secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient polynomial operations in the shared-coefficients setting
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Distributed privacy-preserving methods for statistical disclosure control
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Privacy-Preserving network aggregation
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Resource fairness and composability of cryptographic protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient cryptographic protocol design based on distributed el gamal encryption
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Private similarity computation in distributed systems: from cryptography to differential privacy
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Mutual private set intersection with linear complexity
WISA'11 Proceedings of the 12th international conference on Information Security Applications
Efficient RSA key generation and threshold paillier in the two-party setting
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
On constructing homomorphic encryption schemes from coding theory
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Efficient Protocols for Principal Eigenvector Computation over Private Data
Transactions on Data Privacy
Privacy Preserving Aggregation of Secret Classifiers
Transactions on Data Privacy
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
iPIN and mTAN for secure eID applications
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Multiparty computation with low communication, computation and interaction via threshold FHE
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Shift-type homomorphic encryption and its application to fully homomorphic encryption
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
On the amortized complexity of zero knowledge protocols for multiplicative relations
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Secure two-party computations in ANSI C
Proceedings of the 2012 ACM conference on Computer and communications security
On partial anonymity in secret sharing
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
Efficient committed oblivious transfer of bit strings
ISC'07 Proceedings of the 10th international conference on Information Security
Secure computations on non-integer values with applications to privacy-preserving sequence analysis
Information Security Tech. Report
Black-Box proof of knowledge of plaintext and multiparty computation with low communication overhead
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Secure multiparty aggregation with differential privacy: a comparative study
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Group homomorphic encryption: characterizations, impossibility results, and applications
Designs, Codes and Cryptography
An efficient and probabilistic secure bit-decomposition
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Reliable medical recommendation systems with patient privacy
ACM Transactions on Intelligent Systems and Technology (TIST) - Survey papers, special sections on the semantic adaptive social web, intelligent systems for health informatics, regular papers
Privacy-preserving billing for e-ticketing systems in public transportation
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
An efficient privacy-preserving solution for finding the nearest doctor
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type, general MPC protocols for n parties can be devised which are secure against an active adversary that corrupts any minority of the parties. The total number of bits broadcast is O(nk|C|), where k is the security parameter and |C| is the size of a (Boolean) circuit computing the function to be securely evaluated. An earlier proposal by Franklin and Haber with the same complexity was only secure for passive adversaries, while all earlier protocols with active security had complexity at least quadratic in n. We give two examples of threshold cryptosystems that can support our construction and lead to the claimed complexities.