Pages that link to "Item:Q5230329"
From MaRDI portal
The following pages link to Multi-collision resistance: a paradigm for keyless hash functions (Q5230329):
Displaying 21 items.
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Black-box non-interactive non-malleable commitments (Q2056786) (← links)
- On the CCA compatibility of public-key infrastructure (Q2061956) (← links)
- On subset-resilient hash function families (Q2115743) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Collision Resistance from Multi-collision Resistance (Q6489330) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer (Q6595938) (← links)
- Collision resistance from multi-collision resistance for all constant parameters (Q6652976) (← links)
- Reusable online-efficient commitments (Q6653022) (← links)
- Doubly efficient cryptography: commitments, arguments and RAM MPC (Q6653029) (← links)
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions (Q6660291) (← links)