Pairing-based non-interactive zero-knowledge proofs

DOI10.1007/978-3-642-17455-1_13MaRDI QIDQ3059651zbMATH OpenOpenAlexFDO

Authors Jens Groth

Publication date 26 November 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-17455-1_13

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient noninteractive proof systems for bilinear groups
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Short pairing-based non-interactive zero-knowledge arguments
• New techniques for noninteractive zero-knowledge
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

Cited in

(11)

• Provably secure non-interactive key distribution based on pairings
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Short pairing-based non-interactive zero-knowledge arguments
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• Efficient noninteractive proof systems for bilinear groups
• New techniques for noninteractive zero-knowledge
• Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
• Efficient Non-interactive Proof Systems for Bilinear Groups
• There is no safe pairing function over an arbitrary structure
• Security in Communication Networks
• Vector commitments with proofs of smallness: short range proofs and more

This page was built for publication: Pairing-based non-interactive zero-knowledge proofs

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