| Making NTRU as Secure as Worst-Case Problems over Ideal Lattices D Stehlé, R Steinfeld Annual international conference on the theory and applications of …, 2011 | 517 | 2011 |
| Faster fully homomorphic encryption D Stehlé, R Steinfeld International Conference on the Theory and Application of Cryptology and …, 2010 | 472 | 2010 |
| Formal proofs for the security of signcryption J Baek, R Steinfeld, Y Zheng International Workshop on Public Key Cryptography, 80-98, 2002 | 344 | 2002 |
| Efficient public key encryption based on ideal lattices D Stehlé, R Steinfeld, K Tanaka, K Xagawa International Conference on the Theory and Application of Cryptology and …, 2009 | 332 | 2009 |
| Universal designated-verifier signatures R Steinfeld, L Bull, H Wang, J Pieprzyk International Conference on the Theory and Application of Cryptology and …, 2003 | 295 | 2003 |
| Content extraction signatures R Steinfeld, L Bull, Y Zheng International Conference on Information Security and Cryptology, 285-304, 2001 | 285 | 2001 |
| GGHLite: More efficient multilinear maps from ideal lattices A Langlois, D Stehlé, R Steinfeld Annual International Conference on the Theory and Applications of …, 2014 | 172 | 2014 |
| Formal proofs for the security of signcryption J Baek, R Steinfeld, Y Zheng Journal of cryptology 20 (2), 203-235, 2007 | 168 | 2007 |
| Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance S Bai, T Lepoint, A Roux-Langlois, A Sakzad, D Stehlé, R Steinfeld Journal of Cryptology 31 (2), 610-640, 2018 | 167 | 2018 |
| VSH, an efficient and provable collision-resistant hash function S Contini, AK Lenstra, R Steinfeld Annual International Conference on the Theory and Applications of …, 2006 | 147 | 2006 |
| Efficient extension of standard Schnorr/RSA signatures into universal designated-verifier signatures R Steinfeld, H Wang, J Pieprzyk International Workshop on Public Key Cryptography, 86-100, 2004 | 142 | 2004 |
| Practical backward-secure searchable encryption from symmetric puncturable encryption SF Sun, X Yuan, JK Liu, R Steinfeld, A Sakzad, V Vo, S Nepal Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 135 | 2018 |
| A signcryption scheme based on integer factorization R Steinfeld, Y Zheng International Workshop on Information Security, 308-322, 2000 | 135 | 2000 |
| An efficient non-interactive multi-client searchable encryption with support for boolean queries SF Sun, JK Liu, A Sakzad, R Steinfeld, TH Yuen European symposium on research in computer security, 154-172, 2016 | 100 | 2016 |
| Result pattern hiding searchable encryption for conjunctive queries S Lai, S Patranabis, A Sakzad, JK Liu, D Mukhopadhyay, R Steinfeld, ... Proceedings of the 2018 ACM SIGSAC conference on computer and communications …, 2018 | 98 | 2018 |
| Platform-independent secure blockchain-based voting system B Yu, JK Liu, A Sakzad, S Nepal, R Steinfeld, P Rimba, MH Au International Conference on Information Security, 369-386, 2018 | 93 | 2018 |
| Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006 | 85 | 2006 |
| Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice RingCT v1. 0) WA Alberto Torres, R Steinfeld, A Sakzad, JK Liu, V Kuchta, ... Australasian Conference on Information Security and Privacy, 558-576, 2018 | 77 | 2018 |
| How to strengthen any weakly unforgeable signature into a strongly unforgeable signature R Steinfeld, J Pieprzyk, H Wang Cryptographers’ Track at the RSA Conference, 357-371, 2007 | 63 | 2007 |
| Hardness of k-LWE and applications in traitor tracing S Ling, DH Phan, D Stehlé, R Steinfeld Algorithmica 79 (4), 1318-1352, 2017 | 62 | 2017 |
Huaxiong WangNanyang Technological University, SingaporeVerified email at ntu.edu.sg
