Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
- Stanisław JareckiAffiliated withMIT Laboratory for Computer Science
- , Anna LysyanskayaAffiliated withMIT Laboratory for Computer Science
We put forward two new measures of security for threshold schemes secure in the adaptive adversary model: security under concurrent composition; and security without the assumption of reliable erasure. Using novel constructions and analytical tools, in both these settings, we exhibit efficient secure threshold protocols for a variety of cryptographic applications. In particular, based on the recent scheme by Cramer-Shoup, we construct adaptively secure threshold cryptosystems secure against adaptive chosen ciphertext attack under the DDH intractability assumption. Our techniques are also applicable to other cryptosystems and signature schemes, like RSA, DSS, and ElGamal. Our techniques include the first efficient implementation, for a wide but special class of protocols, of secure channels in erasure-free adaptive model.
Of independent interest, we present the notion of a committed proof.
- Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
- Book Title
- Advances in Cryptology — EUROCRYPT 2000
- Book Subtitle
- International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14–18, 2000 Proceedings
- pp 221-242
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.