On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions-Reference-Cited by-同舟云学术

On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions

Published:2020 Issue: Volume: Page:303-332
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Jager Tibor,Niehues David

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-38471-5_13

Reference49 articles.

1. Lecture Notes in Computer Science;M Abdalla,2012

2. Attrapadung, N., Matsuda, T., Nishimaki, R., Yamada, S., Yamakawa, T.: Adaptively single-key secure constrained PRFs for NC1. IACR Cryptol. ePrint Arch. 2018, 1000 (2018)

3. Lecture Notes in Computer Science;N Attrapadung,2018

4. Lecture Notes in Computer Science;M Bellare,2009

5. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 93, pp. 62–73. ACM Press (November 1993)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DID-based Distributed Verifiable Random Function with Successor Rule-based de Bruijn Sequence in Blockchain;Proceedings of the 2023 6th International Conference on Blockchain Technology and Applications;2023-12-15

2. Smart Contract-based Secure Verifiable Random Function using ChaCha20 Sequence in Blockchain;Proceedings of the 2023 5th International Conference on Blockchain Technology;2023-11-10

3. Continuous improvement of script-driven verifiable random functions for reducing computing power in blockchain consensus protocols;Peer-to-Peer Networking and Applications;2021-10-06

4. Verifiable Random Functions with Optimal Tightness;Public-Key Cryptography – PKC 2021;2021

5. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance;Public-Key Cryptography – PKC 2021;2021