Open AccessJournal Article
New efficient and secure protocols for verifiable signature sharing and other applications
Dario Catalano,Rosario Gennaro +1 more
Reads0
Chats0
TLDR
The Verifiable Signature Sharing (VΣS) protocol as mentioned in this paper enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subset of them can later reconstruct it.Abstract:
Verifiable Signature Sharing (VΣS) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subset of them can later reconstruct it. The original RSA and Rabin VΣS protocols were subsequently broken and the original DSS VΣS lacks a formal proof of security. We present new protocols for RSA, Rabin and DSS VΣS. Our protocols are efficient and provably secure and can tolerate the malicious behavior of up to half of the proxies. Furthermore we believe that some of our techniques are of independent interest. Some of the by-products of our main result are: a new threshold cryptosystem, a new undeniable signature scheme and a way to create binding RSA cryptosystems.read more
Citations
More filters
Book ChapterDOI
The knowledge complexity of interactive proof-systems
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
Book ChapterDOI
Traitor Tracing with Constant Transmission Rate
Aggelos Kiayias,Moti Yung +1 more
TL;DR: The first public-key traitor tracing scheme with constant transmission rate was proposed by Naccac, Shamir, and Stern as mentioned in this paper, which achieves the same expansion efficiency as regular ElGamal encryption.
Book ChapterDOI
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Jan Camenisch,Victor Shoup +1 more
TL;DR: The first verifiable encryption scheme that provides chosen ciphertext security and avoids inefficient cut-and-choose proofs was proposed in this article, based on Paillier's decision composite residuosity assumption.
Journal ArticleDOI
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
Victor Shoup,Rosario Gennaro +1 more
TL;DR: This paper presents two very practical threshold cryptosystems and proves that they are secure against chosen ciphertext attack in the random oracle model, and not only are these protocols computationally very efficient, but they are also non-interactive, which means they can be easily run over an asynchronous communication network.
Book ChapterDOI
A Group Signature Scheme with Improved Efficiency (Extended Abstract)
Jan Camenisch,Markus Michels +1 more
TL;DR: This paper proposes a new group signature scheme that is well suited for large groups, i.e., the length of the group’s public key and of signatures do not depend on the size of the groups.
Related Papers (5)
How to prove yourself: practical solutions to identification and signature problems
Amos Fiat,Adi Shamir +1 more