Pages that link to "Item:Q2796131"
From MaRDI portal
The following pages link to Verifiable Random Functions from Standard Assumptions (Q2796131):
Displayed 10 items.
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- Verifiable random functions with optimal tightness (Q2061948) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Partitioned searchable encryption (Q2697909) (← links)
- Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Logarithmic-size (linkable) threshold ring signatures in the plain model (Q6113965) (← links)
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions (Q6162383) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)