Author:
Catalano Dario,Gennaro Rosario,Howgrave-Graham Nick
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. W. Alexi, B. Chor, O. Goldreich and C. Schnorr. RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Computing, 17(2):194–209, April 1988.
2. J.C. Benaloh. Verifiable Secret-Ballot Elections. Ph.D. Thesis, Yale University, 1988.
3. Lect Notes Comput Sci;M. Blum,1984
4. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing, Vol. 13, No. 4:850–864, 1984
5. R. Fischlin and C.P. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. J. of Cryptology, 13(2):221–244, Spring 2000.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. PROFL: A Privacy-Preserving Federated Learning Method with Stringent Defense Against Poisoning Attacks;2024 27th International Conference on Computer Supported Cooperative Work in Design (CSCWD);2024-05-08
2. Non-Malleable Functions and their Applications;Journal of Cryptology;2022-03-09
3. Privacy preservation of genome data analysis using homomorphic encryption;Service Oriented Computing and Applications;2021-09-14
4. Cloud based private data analytic using secure computation over encrypted data;Journal of King Saud University - Computer and Information Sciences;2021-06
5. Privacy-Preserving Distributed Support Vector Machines;Heterogeneous Data Management, Polystores, and Analytics for Healthcare;2021