Efficient Non-interactive Proof Systems for Bilinear Groups
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Two-round MPC: information-theoretic and black-box
- Certifying trapdoor permutations, revisited
- Fiat-Shamir for highly sound protocols is instantiable
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- The wonderful world of global random oracles
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On the tightness of forward-secure signature reductions
- All-but-many encryption
- How to protect privacy in optimistic fair exchange of digital signatures
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Predicate signatures from pair encodings via dual system proof technique
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Linearly-homomorphic signatures and scalable mix-nets
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Transferable e-cash: a cleaner model and the first practical instantiation
- Revocable hierarchical attribute-based signatures from lattices
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication
- Short identity-based signatures with tight security from lattices
- On instantiating the algebraic group model from falsifiable assumptions
- Witness authenticating NIZKs and applications
- Fine-grained secure attribute-based encryption
- Signatures of knowledge for Boolean circuits under standard assumptions
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Generic plaintext equality and inequality proofs
- Somewhere statistically binding commitment schemes with applications
- Another look at extraction and randomization of Groth's zk-SNARK
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- Skipping the \(q\) in group signatures
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- Dynamic universal accumulator with batch update over bilinear groups
- Subversion-resilient enhanced privacy ID
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Non-interactive zero-knowledge proofs with fine-grained security
- Multilinear maps from obfuscation
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Continuously non-malleable codes in the split-state model
- Offline witness encryption with semi-adaptive security
- Tightly secure ring signatures in the standard model
- Accountable authority identity-based broadcast encryption with constant-size private keys and ciphertexts
- Structure-preserving public-key encryption with leakage-resilient CCA security
- Short tightly secure signatures for signing a vector of group elements: a new approach
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
- Fully leakage-resilient signatures
- Efficient and secure attribute-based signature for monotone predicates
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- QANIZK for adversary-dependent languages and their applications
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Efficient chameleon hash functions in the enhanced collision resistant model
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Privacy-enhanced remote data integrity checking with updatable timestamp
- Hardware security without secure hardware: how to decrypt with a password and a server
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Statistical ZAPs from group-based assumptions
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Laconic private set intersection and applications
- Towards tight adaptive security of non-interactive key exchange
- Policy-compliant signatures
- A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Scalable Divisible E-cash
- Reconfigurable cryptography: a flexible approach to long-term security
- Multilinear maps from obfuscation
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Towards lightweight anonymous entity authentication for IoT applications
- Generalized hardness assumption for self-bilinear map with auxiliary information
- A lattice-based group signature scheme with message-dependent opening
- Offline witness encryption
- Fiat-Shamir for highly sound protocols is instantiable
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Short attribute-based signatures for threshold predicates
- Plaintext-checkable encryption
- Structure-preserving signatures and commitments to group elements
- Signature schemes secure against hard-to-invert leakage
- Generalizing efficient multiparty computation
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Efficient KDM-CCA secure public-key encryption for polynomial functions
- Structure-preserving smooth projective hashing
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Efficient public-key cryptography with bounded leakage and tamper resilience
- Constructions secure against receiver selective opening and chosen ciphertext attacks
- Tightly secure signatures and public-key encryption
- A signature scheme with efficient proof of validity
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Achieving optimal anonymity in transferable e-cash with a judge
- Revocable attribute-based signatures with adaptive security in the standard model
- An analysis of affine coordinates for pairing computation
This page was built for publication: Efficient Non-interactive Proof Systems for Bilinear Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458605)
