Attribute-based versions of Schnorr and ElGamal

DOI10.1007/S00200-015-0270-7MaRDI QIDQ2634583zbMATH OpenOpenAlexFDO

Authors Javier Herranz

Publication date 16 February 2016

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/86060

zbMATH Keywords

attribute-based cryptographydiscrete logarithm settingverifiable computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Attribute-based signatures
• Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
• Attribute-based signatures for circuits from bilinear map
• Expressive bandwidth-efficient attribute based signature and signcryption in standard model
• Efficient attribute-based signatures for unbounded arithmetic branching programs

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• Attribute-based encryption for circuits from multilinear maps
• Attribute-based functional encryption on lattices
• Attribute-based signatures
• Attribute-based signatures from RSA
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Efficient attribute-based signatures for non-monotone predicates in the standard model
• Efficient signature generation by smart cards
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 176568 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• New proof methods for attribute-based encryption: achieving full security through selective techniques
• One-time signatures and chameleon hash functions
• Policy-Based Signatures
• Revocable attribute-based signatures with adaptive security in the standard model
• Security arguments for digital signatures and blind signatures
• Selected Areas in Cryptography
• Simple functional encryption schemes for inner products
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
• Zero-knowledge argument for polynomial evaluation with application to blacklists

Cited in

(2)

• Semi-adaptive attribute-based encryption and improved delegation for Boolean formula
• Enhanced Security of Attribute-Based Signatures

This page was built for publication: Attribute-based versions of Schnorr and ElGamal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634583)