Constrained PRFs for $$\mathrm{NC}^1$$ in Traditional Groups-Reference-Cited by-同舟云学术

Constrained PRFs for $$\mathrm{NC}^1$$ in Traditional Groups

Published:2018 Issue: Volume: Page:543-574
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Attrapadung Nuttapong,Matsuda Takahiro,Nishimaki Ryo,Yamada Shota,Yamakawa Takashi

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96881-0_19

Reference39 articles.

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

2. Lecture Notes in Computer Science;H Abusalah,2016

3. Attrapadung, N., Matsuda, T., Nishimaki, R., Yamada, S., Yamakawa, T.: Constrained PRFs for $$ {NC}^1$$ in traditional groups. IACR Cryptol. ePrint Arch. 2018, 154 (2018)

4. Lecture Notes in Computer Science;D Boneh,2004

5. Bellare, M., Cash, D.: Pseudorandom functions and permutations provably secure against related-key attacks. IACR Cryptol. ePrint Arch., 397 (2010). Version 20150729:233210. Preliminary Version Appeared in CRYPTO 2010

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

1. Fast Public-Key Silent OT and More from Constrained Naor-Reingold;Lecture Notes in Computer Science;2024

2. Constrained Pseudorandom Functions from Homomorphic Secret Sharing;Advances in Cryptology – EUROCRYPT 2023;2023

3. Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant Pseudorandomness;Advances in Cryptology – EUROCRYPT 2023;2023

4. Adaptively Secure Constrained Verifiable Random Function;Science of Cyber Security;2023

5. Adaptive Multiparty NIKE;Theory of Cryptography;2022