Attribute-Based Signatures without Pairings by the Fiat-Shamir Transformation
نویسندگان
چکیده
We propose an attribute-based signature scheme (ABS) with features of pairing-free, short signatures and security proof in the random oracle model. Our strategy is in the Fiat-Shamir paradigm; we first provide a concrete procedure of the Σ-protocol which enables a prover to prove possession of witnesses that satisfy a statement of a monotone boolean formula. Next, using a signature bundle scheme of the Fiat-Shamir signature as those witnesses in the Σ-protocol, we obtain a generic attribute-based identification scheme (ABID). Then, we apply the Fiat-Shamir transform to our ABID to obtain a scheme of ABS. The series of these generic constructions are obtained from a given Σ-protocol. Finally, we provide our ABID and ABS schemes concretely in the Discrete-Logarithm setting and the RSA setting. These concretions are pairing-free. Signatures of our ABS are linkable, hence attribute privacy does not hold; it holds only as a one-time signature.
منابع مشابه
A Second Look at Fischlin's Transformation
Fischlin’s transformation is an alternative to the standard Fiat-Shamir transform to turn a certain class of public key identification schemes into digital signatures (in the random oracle model). We show that signatures obtained via Fischlin’s transformation are existentially unforgeable even in case the adversary is allowed to get arbitrary (yet bounded) information on the entire state of the...
متن کاملOn the (In)security of the Fiat-Shamir Paradigm
In 1986, Fiat and Shamir proposed a general method for transforming secure -round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of the verifier in the identification scheme, with the value of some deterministic“hash” function evaluated on various quantities in the protocol and on the message to be signed. The ...
متن کاملPost-quantum Security of Fiat-Shamir
The Fiat-Shamir construction (Crypto 1986) is an efficient transformation in the random oracle model for creating non-interactive proof systems and signatures from sigmaprotocols. In classical cryptography, Fiat-Shamir is a zero-knowledge proof of knowledge assuming that the underlying sigma-protocol has the zero-knowledge and special soundness properties. Unfortunately, Ambainis, Rosmanis, and...
متن کاملProofs of Knowledge on Monotone Predicates and its Application to Attribute-Based Identifications and Signatures
We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable manner. Inspired by the high-level proposal by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we construct the concrete procedure by extending the so-called OR-proof. Next, using as a witness a credential-bundle of the Fiat-Shamir signatures, we ...
متن کاملProof of Knowledge on Monotone Predicates and its Application to Attribute-Based Identifications and Signatures
We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable manner. Inspired by the high-level proposal by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we construct the concrete procedure by extending the so-called OR-proof. Next, using as a witness a signature-bundle of the Fiat-Shamir signatures, we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014