Ron Steinfeld
Ron Steinfeld
Associate Professor, Monash University
Bestätigte E-Mail-Adresse bei monash.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Faster fully homomorphic encryption
D Stehlé, R Steinfeld
International Conference on the Theory and Application of Cryptology and …, 2010
4192010
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
4182011
Formal proofs for the security of signcryption
J Baek, R Steinfeld, Y Zheng
International Workshop on Public Key Cryptography, 80-98, 2002
3242002
Universal designated-verifier signatures
R Steinfeld, L Bull, H Wang, J Pieprzyk
International Conference on the Theory and Application of Cryptology and …, 2003
2612003
Content extraction signatures
R Steinfeld, L Bull, Y Zheng
International Conference on Information Security and Cryptology, 285-304, 2001
2582001
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
2432009
Formal proofs for the security of signcryption
J Baek, R Steinfeld, Y Zheng
Journal of cryptology 20 (2), 203-235, 2007
1612007
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
1402006
GGHLite: More efficient multilinear maps from ideal lattices
A Langlois, D Stehlé, R Steinfeld
Annual International Conference on the Theory and Applications of …, 2014
1372014
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
1252004
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
1242018
A signcryption scheme based on integer factorization
R Steinfeld, Y Zheng
International Workshop on Information Security, 308-322, 2000
1242000
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
742016
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
612018
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
562007
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
552018
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
452018
Hardness of k-LWE and applications in traitor tracing
S Ling, DH Phan, D Stehlé, R Steinfeld
Algorithmica 79 (4), 1318-1352, 2017
452017
Still jumping on the balance beam: Continued use of perceptual motor programs in Australian schools
J Stephenson, M Carter, K Wheldall
Australian journal of Education 51 (1), 6-18, 2007
40*2007
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
40*2006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20