A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
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
The knowledge complexity of interactive proof systems
SIAM Journal on 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
On the Composition of Zero-Knowledge Proof Systems
SIAM Journal on Computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Proactive public key and signature systems
Proceedings of the 4th ACM conference on Computer and communications security
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of 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
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th 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
Lower Bounds for Zero Knowledge on the Internet
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
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
Adaptive Security for the Additive-Sharing Based Proactive RSA
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
One Round Threshold Discrete-Log Key Generation without Private Channels
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: 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
Securing Mobile Ad Hoc Networks with Certificateless Public Keys
IEEE Transactions on Dependable and Secure Computing
Proactive RSA with Non-interactive Signing
Financial Cryptography and Data Security
Adaptively Secure Two-Party Computation with Erasures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Adaptively secure threshold cryptography: introducing concurrency, removing erasures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Distributed private-key generators for identity-based cryptography
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
A new construction of designated confirmer signature and its application to optimistic fair exchange
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Adaptively secure non-interactive threshold cryptosystems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Password-protected secret sharing
Proceedings of the 18th ACM conference on Computer and communications security
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
A virtual bridge certificate authority model
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Short threshold signature schemes without random oracles
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Universally composable DKG with linear number of exponentiations
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Further simplifications in proactive RSA signatures
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Tracing-by-linking group signatures
ISC'05 Proceedings of the 8th international conference on Information Security
The marriage proposals problem: fair and efficient solution for two-party computations
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Pairing based threshold cryptography improving on libert-quisquater and baek-zheng
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Coercion-resistant electronic elections
Towards Trustworthy Elections
Simplified threshold RSA with adaptive and proactive security
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Adaptively secure forward-secure non-interactive threshold cryptosystems
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Adaptively secure non-interactive threshold cryptosystems
Theoretical Computer Science
Canon-MPC, a system for casual non-interactive secure multi-party computation using native client
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
On a new-member-joining-protocol design using bivariate polynomials based DKG algorithms
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
Signcryption schemes with threshold unsigncryption, and applications
Designs, Codes and Cryptography
Hi-index | 0.00 |
We present adaptively-secure efficient solutions to several central problems in the area of threshold cryptography. We prove these solutions to withstand adaptive attackers that choose parties for corruption at any time during the run of the protocol. In contrast, all previously known efficient protocols for these problems were proven secure only against less realistic static adversaries that choose and fix the subset of corrupted parties before the start of the protocol run. Specifically, we provide adaptively-secure solutions for distributed key generation in discrete-log based cryptosystems, and for the problem of distributed generation of DSS signatures (threshold DSS). We also show how to transform existent static solutions for threshold RSA and proactive schemes to withstand the stronger adaptive attackers. In doing so, we introduce several techniques for the design and analysis of adaptively-secure protocols that may well find further applications.