Efficient Noninteractive Proof Systems for Bilinear Groups

DOI10.1137/080725386zbMath1259.94048OpenAlexW2089537103MaRDI QIDQ4907580

Jens Groth, Amit Sahai

Publication date: 4 February 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/11fab18045eef8c98fc8c2095f364c8dcca7a5c3

zbMATH Keywords

cryptographycryptographic protocolsnoninteractive zero-knowledge proofsnoninteractive witness-indistinguishable proofssatisfiability of equations over bilinear groups

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (35)

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Smooth NIZK arguments ⋮ Tightly secure signatures and public-key encryption ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ An efficient identity tracing scheme for blockchain-based systems ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting ⋮ Unlinkable policy-based sanitizable signatures ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Continuously non-malleable codes in the split-state model ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Compact structure-preserving signatures with almost tight security ⋮ Access Control Encryption for Equality, Comparison, and More ⋮ Non-malleable Codes with Split-State Refresh ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ The electronic cash system based on non-interactive zero-knowledge proofs ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ Aggregatable distributed key generation ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks ⋮ Real Hidden Identity-Based Signatures ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Partially structure-preserving signatures: lower bounds, constructions and more

This page was built for publication: Efficient Noninteractive Proof Systems for Bilinear Groups