Author:
Gentry Craig,Halevi Shai,Lyubashevsky Vadim
Publisher
Springer International Publishing
Reference56 articles.
1. Achlioptas, D.: Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671–687 (2003). https://doi.org/10.1016/S0022-0000(03)00025-4, special Issue on PODS 2001
2. Agrawal, S., Stehlé, D., Yadav, A.: Towards practical and round-optimal lattice-based threshold and blind signatures. IACR Cryptol. ePrint Arch. 2021, 381 (2021). https://eprint.iacr.org/2021/381
3. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9, 169–203 (2015). https://doi.org/10.1515/jmc-2015-0016, https://bitbucket.org/malb/lwe-estimator/src/master/
4. Bai, S., Lepoint, T., Roux-Langlois, A., Sakzad, A., Stehlé, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance. J. Cryptol. 31(2), 610–640 (2017). https://doi.org/10.1007/s00145-017-9265-9
5. Lecture Notes in Computer Science;C Baum,2016
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A different base approach for better efficiency on range proofs;Journal of Information Security and Applications;2024-09
2. SecureVFL: privacy-preserving multi-party vertical federated learning based on blockchain and RSS;Digital Communications and Networks;2024-08
3. SoK: Public Randomness;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08
4. zkMatrix: Batched Short Proof for Committed Matrix Multiplication;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07
5. Springproofs: Efficient Inner Product Arguments for Vectors of Arbitrary Length;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19