Publisher
Springer Nature Switzerland
Reference62 articles.
1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: ACM Symposium on Theory of Computing, STOC 1996, pp. 99–108. ACM (1996)
2. Al Badawi, A., Polyakov, Y., Aung, K.M.M., Veeravalli, B., Rohloff, K.: Implementation and performance evaluation of RNS variants of the BFV homomorphic encryption scheme. IEEE Trans. Emerg. Top. Comput. 9, 941–956 (2021)
3. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9, 169–203 (2015)
4. Ali, A., et al.: Communication-computation trade-offs in PIR. In: USENIX Security 2021, pp. 1811–1828. USENIX, August 2021
5. Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: 2018 IEEE S &P. IEEE Computer Society Press (2018)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Group Oblivious Message Retrieval;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19
2. Anonymity Analysis of the Umbra Stealth Address Scheme on Ethereum;Companion Proceedings of the ACM Web Conference 2024;2024-05-13
3. Poster: Metadata-private Messaging without Coordination;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
4. smartFHE: Privacy-Preserving Smart Contracts from Fully Homomorphic Encryption;2023 IEEE 8th European Symposium on Security and Privacy (EuroS&P);2023-07
5. How to Compress Encrypted Data;Advances in Cryptology – EUROCRYPT 2023;2023