Efficient noninteractive proof systems for bilinear groups
From MaRDI portal
Publication:4907580
DOI10.1137/080725386zbMATH Open1259.94048OpenAlexW2089537103MaRDI QIDQ4907580FDOQ4907580
Authors: 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
Recommendations
cryptographycryptographic protocolsnoninteractive zero-knowledge proofsnoninteractive witness-indistinguishable proofssatisfiability of equations over bilinear groups
Cited In (45)
- Continuously non-malleable codes in the split-state model
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
- A simple and efficient framework of proof systems for NP
- Real Hidden Identity-Based Signatures
- Pairing-based non-interactive zero-knowledge proofs
- New Techniques for Non-interactive Shuffle and Range Arguments
- Improving practical UC-secure commitments based on the DDH assumption
- Smooth NIZK arguments
- Bilinear Groups of Composite Order
- Access Control Encryption for Equality, Comparison, and More
- Compact NIZKs from standard assumptions on bilinear maps
- Tightly secure signatures and public-key encryption
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- An efficient identity tracing scheme for blockchain-based systems
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Partially structure-preserving signatures: lower bounds, constructions and more
- Doubly efficient interactive proofs over infinite and non-commutative rings
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- The electronic cash system based on non-interactive zero-knowledge proofs
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Completeness of single-bit projection-KDM security for public key encryption
- Efficient round-optimal blind signatures in the standard model
- 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
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Compact structure-preserving signatures with almost tight security
- Aggregatable distributed key generation
- IBE with tight security against selective opening and chosen-ciphertext attacks
- New techniques for noninteractive zero-knowledge
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Batch Groth-Sahai
- Efficient fully structure-preserving signatures and shrinking commitments
- On the impossibility of structure-preserving deterministic primitives
- Unlinkable policy-based sanitizable signatures
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- An algebraic framework for Diffie-Hellman assumptions
- Non-malleable Codes with Split-State Refresh
- Classically verifiable NIZK for QMA with preprocessing
This page was built for publication: Efficient noninteractive proof systems for bilinear groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907580)
