Pages that link to "Item:Q5458605"
From MaRDI portal
The following pages link to Efficient Non-interactive Proof Systems for Bilinear Groups (Q5458605):
Displaying 50 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- Signature schemes secure against hard-to-invert leakage (Q290397) (← links)
- Tightly secure signatures and public-key encryption (Q300383) (← links)
- Policy-based signature scheme from lattices (Q306050) (← links)
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
- Round-optimal password-based authenticated key exchange (Q380962) (← links)
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Ambiguous optimistic fair exchange: definition and constructions (Q476859) (← links)
- Public key encryption with keyword search secure against keyword guessing attacks without random oracle (Q497143) (← links)
- Efficient traceable signatures in the standard model (Q631785) (← links)
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) (← links)
- Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Shorter quasi-adaptive NIZK proofs for linear subspaces (Q1698397) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- All-but-many encryption (Q1747665) (← links)
- How to protect privacy in optimistic fair exchange of digital signatures (Q1750341) (← links)
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis (Q1787193) (← links)
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs (Q1791668) (← links)
- Predicate signatures from pair encodings via dual system proof technique (Q2009416) (← links)
- Fully secure functional encryption with a large class of relations from the decisional linear assumption (Q2010596) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme (Q2056805) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Transferable e-cash: a cleaner model and the first practical instantiation (Q2061973) (← links)
- Revocable hierarchical attribute-based signatures from lattices (Q2096621) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication (Q2115719) (← links)
- Short identity-based signatures with tight security from lattices (Q2118556) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Witness authenticating NIZKs and applications (Q2139626) (← links)
- Fine-grained secure attribute-based encryption (Q2139633) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- Generic plaintext equality and inequality proofs (Q2145406) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- Selectively linkable group signatures -- stronger security and preserved verifiability (Q2149824) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- Skipping the \(q\) in group signatures (Q2152050) (← links)
