Pages that link to "Item:Q3600211"
From MaRDI portal
The following pages link to Programmable Hash Functions and Their Applications (Q3600211):
Displaying 29 items.
- Non-adaptive programmability of random oracle (Q500974) (← 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)
- Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions (Q831176) (← links)
- Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions (Q1671634) (← links)
- Confined guessing: new signatures from standard assumptions (Q2018822) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- How (not) to design strong-RSA signatures (Q2430687) (← links)
- Lattice-based completely non-malleable public-key encryption in the standard model (Q2448075) (← links)
- Tight security for signature schemes without random oracles (Q2516531) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
- Short Attribute-Based Signatures for Threshold Predicates (Q2889994) (← links)
- Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More (Q2890012) (← links)
- Ambiguous One-Move Nominative Signature Without Random Oracles (Q3193272) (← links)
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs (Q3408212) (← links)
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys (Q3457069) (← links)
- Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening (Q3623060) (← links)
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme (Q3627448) (← links)
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes (Q3637135) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles (Q5502754) (← links)
- Predictable Arguments of Knowledge (Q5738785) (← links)
- Lattice-based programmable hash functions and applications (Q6182001) (← links)
- Adaptively secure identity-based encryption from middle-product learning with errors (Q6535491) (← links)