Verifiable random function (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Verifiable random function" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

3iacr.org

5,032^nd place

3,357^th place

2worldcat.org

5^th place

2harvard.edu

18^th place

17^th place

2bu.edu

2,120^th place

1,328^th place

1semanticscholar.org

11^th place

8^th place

1yahoo.com

38^th place

40^th place

1inria.fr

4,903^rd place

3,679^th place

1psu.edu

207^th place

136^th place

1nccgroup.com

low place

bu.edu (Global: 2,120^th place; English: 1,328^th place)

open.bu.edu

Goldberg, Sharon; Vcelak, Jan; Papadopoulos, Dimitrios; Reyzin, Leonid (5 March 2018). Verifiable Random Functions (VRFs) (PDF) (Technical report). Retrieved 15 August 2021.

cs.bu.edu

Goldberg, Sharon. "NSEC5: Provably Preventing DNSSEC Zone Enumeration". www.cs.bu.edu. Retrieved 2021-08-26.

doi.org (Global: 2^nd place; English: 2^nd place)

Bitansky, Nir (2020-04-01). "Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs". Journal of Cryptology. 33 (2): 459–493. doi:10.1007/s00145-019-09331-1. ISSN 1432-1378. S2CID 253636177.
Micali, Silvio; Rabin, Michael O.; Vadhan, Salil P. (1999). "Verifiable random functions" (PDF). Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. 40th Annual Symposium on Foundations of Computer Science. pp. 120–130. doi:10.1109/SFFCS.1999.814584. ISBN 0-7695-0409-4.
Hofheinz, Dennis; Jager, Tibor (30 October 2015). Verifiable Random Functions from Standard Assumptions. Theory of Cryptography Conference (published 19 December 2015). pp. 336–362. CiteSeerX 10.1.1.738.9975. doi:10.1007/978-3-662-49096-9_14. ISBN 978-3-662-49096-9.
Barak, Boaz; Ong, Shien Jin; Vadhan, Salil (2007-01-01). "Derandomization in Cryptography" (PDF). SIAM Journal on Computing. 37 (2): 380–400. doi:10.1137/050641958. ISSN 0097-5397. Retrieved 2 September 2021.
Boneh, Dan; Waters, Brent (2013). "Constrained Pseudorandom Functions and Their Applications". In Sako, Kazue; Sarkar, Palash (eds.). Advances in Cryptology - ASIACRYPT 2013. Lecture Notes in Computer Science. Vol. 8270. Berlin, Heidelberg: Springer. pp. 280–300. doi:10.1007/978-3-642-42045-0_15. ISBN 978-3-642-42045-0. Retrieved 2 September 2021.
Micali, Silvio; Reyzin, Leonid (2001). "Soundness in the Public-Key Model". In Kilian, Joe (ed.). Advances in Cryptology — CRYPTO 2001. Lecture Notes in Computer Science. Vol. 2139. Berlin, Heidelberg: Springer. pp. 542–565. doi:10.1007/3-540-44647-8_32. ISBN 978-3-540-44647-7.
Dodis, Yevgeniy (2002). "Efficient Construction of (Distributed) Verifiable Random Functions". In Desmedt, Yvo G. (ed.). Public Key Cryptography — PKC 2003. Lecture Notes in Computer Science. Vol. 2567. Berlin, Heidelberg: Springer. pp. 1–17. doi:10.1007/3-540-36288-6_1. ISBN 978-3-540-36288-3.

harvard.edu (Global: 18^th place; English: 17^th place)

dash.harvard.edu

Micali, Silvio; Rabin, Michael O.; Vadhan, Salil P. (1999). "Verifiable random functions" (PDF). Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. 40th Annual Symposium on Foundations of Computer Science. pp. 120–130. doi:10.1109/SFFCS.1999.814584. ISBN 0-7695-0409-4.
Barak, Boaz; Ong, Shien Jin; Vadhan, Salil (2007-01-01). "Derandomization in Cryptography" (PDF). SIAM Journal on Computing. 37 (2): 380–400. doi:10.1137/050641958. ISSN 0097-5397. Retrieved 2 September 2021.

iacr.org (Global: 5,032^nd place; English: 3,357^th place)

eprint.iacr.org

Dodis, Yevgeniy; Yampolskiy, Aleksandr (16 November 2004). "A Verifiable Random Function With Short Proofs and Keys" (PDF). 8th International Workshop on Theory and Practice in Public Key Cryptography. International Workshop on Public Key Cryptography. Springer, Berlin, Heidelberg (published 2005). pp. 416–431. ISBN 978-3-540-30580-4. Retrieved 26 August 2021.
Boneh, Dan; Waters, Brent (2013). "Constrained Pseudorandom Functions and Their Applications". In Sako, Kazue; Sarkar, Palash (eds.). Advances in Cryptology - ASIACRYPT 2013. Lecture Notes in Computer Science. Vol. 8270. Berlin, Heidelberg: Springer. pp. 280–300. doi:10.1007/978-3-642-42045-0_15. ISBN 978-3-642-42045-0. Retrieved 2 September 2021.
Esgin, Muhammed F.; Kuchta, Veronika; Sakzad, Amin; Steinfeld, Ron; Zhang, Zhenfei; Sun, Shifeng; Chu, Shumo (24 March 2021). "Practical Post-Quantum Few-Time Verifiable Random Function with Applications to Algorand". Cryptology ePrint Archive. Retrieved 26 August 2021.

inria.fr (Global: 4,903^rd place; English: 3,679^th place)

hal.inria.fr

Nountu, Thierry Mefenza (28 November 2017). Pseudo-Random Generators and Pseudo-Random Functions: Cryptanalysis and Complexity Measures (Thèse de doctorat thesis).

nccgroup.com (Global: low place; English: low place)

research.nccgroup.com

Schorn, Eric (2020-02-24). "Reviewing Verifiable Random Functions". NCC Group Research. Retrieved 2021-09-04.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Hofheinz, Dennis; Jager, Tibor (30 October 2015). Verifiable Random Functions from Standard Assumptions. Theory of Cryptography Conference (published 19 December 2015). pp. 336–362. CiteSeerX 10.1.1.738.9975. doi:10.1007/978-3-662-49096-9_14. ISBN 978-3-662-49096-9.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Bitansky, Nir (2020-04-01). "Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs". Journal of Cryptology. 33 (2): 459–493. doi:10.1007/s00145-019-09331-1. ISSN 1432-1378. S2CID 253636177.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Bitansky, Nir (2020-04-01). "Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs". Journal of Cryptology. 33 (2): 459–493. doi:10.1007/s00145-019-09331-1. ISSN 1432-1378. S2CID 253636177.
Barak, Boaz; Ong, Shien Jin; Vadhan, Salil (2007-01-01). "Derandomization in Cryptography" (PDF). SIAM Journal on Computing. 37 (2): 380–400. doi:10.1137/050641958. ISSN 0097-5397. Retrieved 2 September 2021.

yahoo.com (Global: 38^th place; English: 40^th place)

finance.yahoo.com

Potter, John (9 September 2021). "How Can Value Investors Profit in the Crypto Ecosystem?". finance.yahoo.com. Retrieved 19 September 2021.