Efficient noninteractive proof systems for bilinear groups
From MaRDI portal
Recommendations
Cited in
(48)- Continuously non-malleable codes in the split-state model
- Classically verifiable NIZK for QMA with preprocessing
- 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
- Tightly secure signatures and public-key encryption
- Access Control Encryption for Equality, Comparison, and More
- Compact NIZKs from standard assumptions on bilinear maps
- 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
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Aggregate signatures tightly secure under adaptive corruptions
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- The electronic cash system based on non-interactive zero-knowledge proofs
- 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
- Blind signatures from proofs of inequality
- Compact structure-preserving signatures with almost tight security
- IBE with tight security against selective opening and chosen-ciphertext attacks
- Aggregatable distributed key generation
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- New techniques for noninteractive zero-knowledge
- Extended policy-based sanitizable signatures
- Efficient fully structure-preserving signatures and shrinking commitments
- Batch Groth-Sahai
- On the impossibility of structure-preserving deterministic primitives
- An algebraic framework for Diffie-Hellman assumptions
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Unlinkable policy-based sanitizable signatures
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Non-malleable Codes with Split-State Refresh
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)
