Batch Groth–Sahai

DOI10.1007/978-3-642-13708-2_14zbMath1315.94061OpenAlexW3029739590MaRDI QIDQ3575048

Malika Izabachène, Olivier Blazy, Damien Vergnaud, Georg Fuchsbauer, Amandine Jambert, Hervé Sibert

Publication date: 6 July 2010

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13708-2_14

zbMATH Keywords

pairing-based cryptographybatch verificationGroth-Sahai proof system

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Skipping the \(q\) in group signatures ⋮ Unlinkable policy-based sanitizable signatures ⋮ Traceable constant-size multi-authority credentials ⋮ Efficient traceable signatures in the standard model ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Compact structure-preserving signatures with almost tight security ⋮ Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: Batch Groth–Sahai