Old Web
English
Sign In
Acemap
>
Paper
>
On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.
On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.
2019
Tibor Jager
David Niehues
Keywords:
Theoretical computer science
Verifiable secret sharing
Computer science
Hash function
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]