Pages that link to "Item:Q2061948"
From MaRDI portal
The following pages link to Verifiable random functions with optimal tightness (Q2061948):
Displaying 12 items.
- On the real-world instantiability of admissible hash functions and efficient verifiable random functions (Q778928) (← 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)
- Optimal tightness for chain-based unique signatures (Q2170062) (← links)
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs (Q2289439) (← links)
- Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
- Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions (Q3190154) (← links)
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness (Q6157528) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
- Verifiable Obtained Random Subsets for Improving SPHINCS+ (Q6488404) (← links)
- Practical verifiable random function with RKA security (Q6535499) (← links)
