Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices-Reference-Cited by-同舟云学术

Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices

Published:2021 Issue: Volume: Page:261-289
ISSN:0302-9743
Container-title:Public-Key Cryptography – PKC 2021
language:
Short-container-title:

Author:

Albrecht Martin R.,Davidson Alex,Deo Amit,Smart Nigel P.

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-75248-4_10

Reference47 articles.

1. Albrecht, M.R., Davidson, A., Deo, A., Smart, N.P.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices. Cryptology ePrint Archive, Report 2019/1271 (2019). https://eprint.iacr.org/2019/1271

2. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169–203 (2015). http://www.degruyter.com/view/j/jmc.2015.9.issue-3/jmc-2015-0016/jmc-2015-0016.xml

3. Alkim, E., Ducas, L., Pöppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: Holz, T., Savage, S. (eds.) USENIX Security 2016, pp. 327–343. USENIX Association (2016)

4. Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296(1), (1993)

5. LNCS;A Banerjee,2014

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

1. OPRFs from Isogenies;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

2. QPASE: Quantum-Resistant Password-Authenticated Searchable Encryption for Cloud Storage;IEEE Transactions on Information Forensics and Security;2024

3. A Post-Quantum Round-Optimal Oblivious PRF from Isogenies;Lecture Notes in Computer Science;2024

4. Crypto Dark Matter on the Torus;Lecture Notes in Computer Science;2024

5. BRAKE: Biometric Resilient Authenticated Key Exchange;IEEE Access;2024