Pages that link to "Item:Q1701449"
From MaRDI portal
The following pages link to Zero-knowledge arguments for lattice-based PRFs and applications to E-cash (Q1701449):
Displaying 13 items.
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- Traceable policy-based signatures and instantiation from lattices (Q6195214) (← links)
