Sciweavers

16 search results - page 2 / 4
» Universally Composable Key-Evolving Signature
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
13 years 10 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
14 years 12 days ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
CSFW
2009
IEEE
14 years 1 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
14 years 1 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to a...
Jörn Müller-Quade, Dominique Unruh