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

DOI10.1007/978-3-031-14791-3_31zbMath1518.94123OpenAlexW4294768221MaRDI QIDQ6134855

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)

Cites Work

• Unnamed Item
• Structure-preserving signatures and commitments to group elements
• Non-interactive zero-knowledge proofs for composite statements
• An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both
• Attribute-based signatures for unbounded languages from standard assumptions
• Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
• Efficient attribute-based signatures for unbounded arithmetic branching programs
• Attribute-Based Signatures for Circuits from Bilinear Map
• Attribute-Based Signatures
• Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model
• On the (In)Security of SNARKs in the Presence of Oracles
• Attribute-Based Signatures for Circuits from Multilinear Maps
• Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
• Universal circuits (Preliminary Report)
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Functional Signatures and Pseudorandom Functions
• On the Size of Pairing-Based Non-interactive Arguments

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