Anonymous Signatures Made Easy
نویسنده
چکیده
At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of the message are unknown. They also show how to modify the RSA scheme and the Schnorr scheme to derive anonymous signatures in the random oracle model. Here we present a general and yet very efficient approach to build such anonymous schemes from ordinary signature schemes. When instantiated in the random oracle model, our solution is essentially as efficient as the original scheme, whereas our construction also supports an almost as efficient instantiation in the standard model.
منابع مشابه
Privacy-Enhancing Proxy Signatures from Non-interactive Anonymous Credentials
Proxy signatures enable an originator to delegate the signing rights for a restricted set of messages to a proxy. The proxy is then able to produce valid signatures only for messages from this delegated set on behalf of the originator. Recently, two variants of privacy-enhancing proxy signatures, namely blank signatures [27] and warrant-hiding proxy signatures [28], have been introduced. In thi...
متن کاملA Study on Efficient Group-oriented Signature Schemes for Realistic Application Environment
Rapid development of data processing systems has made digital signatures an essential application. A digital signature basically associates a signer with the message. Its important characteristics are easy verification, unforgeability and undeniability. However, conventional digital signature schemes generally consider only single signer situations; this is impractical, because the authorized s...
متن کاملPractical Fair Anonymous Undeniable Signatures
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also track the illegal utilization of the valid signatures. In addition, our model prevents the trusted centre from forging a valid signature for any signer. Keywords—Cryptography, Fair Anonymity, Information Security, RSA Sig...
متن کاملAutomorphic Signatures in Bilinear Groups
We introduce the notion of automorphic signatures, which satisfy the following properties: the verification keys lie in the message space, messages and signatures consist of group elements only, and verification is done by evaluating a set of pairing-product equations. These signatures make a perfect counterpart to the powerful proof system by Groth and Sahai (Eurocrypt 2008). We provide practi...
متن کاملAnonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures
We define a general model for consecutive delegations of signing rights with the following properties: The delegatee actually signing and all intermediate delegators remain anonymous. As for group signatures, in case of misuse, a special authority can open signatures to reveal all delegators’ and the signer’s identity. The scheme satisfies a strong notion of non-frameability generalizing the on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007