Pages that link to "Item:Q6169431"
From MaRDI portal
The following pages link to The price of verifiability: lower bounds for verifiable random functions (Q6169431):
Displaying 11 items.
- On the real-world instantiability of admissible hash functions and efficient verifiable random functions (Q778928) (← links)
- Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds (Q1405738) (← links)
- Verifiable random functions with optimal tightness (Q2061948) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs (Q2289439) (← links)
- Weak Verifiable Random Functions (Q3611788) (← links)
- Public Key Cryptography - PKC 2005 (Q5711583) (← links)
- Lower Bounds in the Hardware Token Model (Q5746358) (← links)
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions (Q6162383) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
