Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs

DOI10.1007/978-3-031-14791-3_31zbMATH Open1518.94123OpenAlexW4294768221MaRDI QIDQ6134855FDOQ6134855

Authors Yusuke Sakai 

Publication date 25 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-14791-3_31

zbMATH Keywords

bounded-size arbitrary arithmetic circuitsfine-grained attribute-based authenticationsuccinct non-interactive arguments of knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
• Attribute-based signatures for circuits from bilinear map
• Attribute-based signatures for circuits from multilinear maps
• Efficient attribute-based signatures for unbounded arithmetic branching programs
• Compact Attribute-Based Encryption and Signcryption for General Circuits from Multilinear Maps
• Short attribute-based signatures for arbitrary Turing machines from standard assumptions
• An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both
• Attribute-based signatures
• Attribute-based signatures for circuits from bilinear map
• Attribute-based signatures for circuits from multilinear maps
• Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
• Attribute-based signatures for unbounded languages from standard assumptions
• Efficient attribute-based signatures for non-monotone predicates in the standard model
• Efficient attribute-based signatures for unbounded arithmetic branching programs
• Efficient noninteractive proof systems for bilinear groups
• Functional signatures and pseudorandom functions
• Non-interactive zero-knowledge proofs for composite statements
• On the (in)security of SNARKs in the presence of oracles
• On the size of pairing-based non-interactive arguments
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Structure-preserving signatures and commitments to group elements
• Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
• Universal circuits (Preliminary Report)

Cited in

(3)

• Efficient attribute-based signatures for unbounded arithmetic branching programs
• Attribute-based signatures for circuits from bilinear map
• Attribute-based versions of Schnorr and ElGamal

This page was built for publication: Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs

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