World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
6846
World Ranking
11538
National Ranking
348

Overview

Ron Steinfeld is affiliated with Monash University in Australia and has contributed extensively to the field of computer science, with a particular focus on cryptography and data security. Their work spans a variety of subfields, including artificial intelligence, information systems, computer vision and pattern recognition, computational theory and mathematics, and computer networks and communications.

The scientist's research has emphasized several core topics, notably cryptography and data security, privacy-preserving technologies in data, cryptographic implementations and security, blockchain technology applications and security, chaos-based image and signal encryption, coding theory and cryptography, and complexity and algorithms in graphs.

Key recent papers authored or coauthored by Ron Steinfeld include:

  • Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation (2020), published in IEEE Transactions on Dependable and Secure Computing
  • MatRiCT+: More Efficient Post-Quantum Private Blockchain Payments (2022), published in 2022 IEEE Symposium on Security and Privacy (SP)
  • A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions (2022), published in ACM Computing Surveys
  • Geometric Range Search on Encrypted Data With Forward/Backward Security (2020), published in IEEE Transactions on Dependable and Secure Computing
  • High Throughput Lattice-Based Signatures on GPUs: Comparing Falcon and Mitaka (2024), published in IEEE Transactions on Parallel and Distributed Systems

Ron Steinfeld has collaborated frequently with several researchers, including:

  • Amin Sakzad
  • Joseph K. Liu
  • Shabnam Kasra Kermanshahi
  • Muhammed F. Esgin
  • Sara Jafarbeiki

The scientist's work has appeared in multiple publication venues, with notable recurring contributions to:

  • arXiv (Cornell University)
  • Designs Codes and Cryptography
  • IEEE Transactions on Dependable and Secure Computing
  • 2022 IEEE Symposium on Security and Privacy (SP)
  • ACM Computing Surveys

Ron Steinfeld has also contributed to academic books published by Springer Science+Business Media. The published titles include multiple editions of "Advances in Cryptology - ASIACRYPT 2023."

Best Publications

  • Making NTRU as secure as worst-case problems over ideal lattices

    Damien Stehlé;Ron Steinfeld

  • Formal Proofs for the Security of Signcryption

    Joonsang Baek;Ron Steinfeld;Yuliang Zheng

  • Faster Fully Homomorphic Encryption

    Damien Noel Stehle;Ron Steinfeld

  • Efficient Public Key Encryption Based on Ideal Lattices.

    Damien Stehlé;Ron Steinfeld;Keisuke Tanaka;Keita Xagawa

  • Content Extraction Signatures

    Ron Steinfeld;Laurence Bull;Yuliang Zheng

  • Universal Designated-Verifier Signatures

    Ron Steinfeld;Laurence Bull;Huaxiong Wang;Josef Pieprzyk

  • Practical Backward-Secure Searchable Encryption from Symmetric Puncturable Encryption

    Shi-Feng Sun;Xingliang Yuan;Joseph K. Liu;Ron Steinfeld

  • Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance

    Shi Bai;Tancrède Lepoint;Adeline Roux-Langlois;Amin Sakzad

  • Result Pattern Hiding Searchable Encryption for Conjunctive Queries.

    Shangqi Lai;Sikhar Patranabis;Amin Sakzad;Joseph K. Liu

  • GGHLite: More Efficient Multilinear Maps from Ideal Lattices

    Adeline Langlois;Damien Noel Stehle;Ron Steinfeld

  • Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.

    Shi Bai;Adeline Langlois;Tancrède Lepoint;Damien Stehlé

  • VSH, an efficient and provable collision-resistant hash function

    Scott Contini;Arjen K. Lenstra;Ron Steinfeld

  • Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures

    Ron Steinfeld;Huaxiong Wang;Josef Pieprzyk

  • Platform-Independent Secure Blockchain-Based Voting System

    Bin Yu;Joseph K. Liu;Amin Sakzad;Surya Nepal

  • A Signcryption Scheme Based on Integer Factorization

    Ron Steinfeld;Yuliang Zheng

  • An efficient non-interactive multi-client searchable encryption with support for boolean queries

    Shi Feng Sun;Joseph K. Liu;Amin Sakzad;Ron Steinfeld

  • Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (Lattice RingCT v1.0)

    Wilson Abel Alberto Torres;Ron Steinfeld;Amin Sakzad;Joseph K. Liu

  • MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol.

    Muhammed F. Esgin;Raymond K. Zhao;Ron Steinfeld;Joseph K. Liu

  • Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy.

    Shifeng Sun;Ron Steinfeld;Shangqi Lai;Xingliang Yuan

  • Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications.

    Muhammed F. Esgin;Ron Steinfeld;Joseph K. Liu;Dongxi Liu

  • Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices.

    Damien Stehlé;Ron Steinfeld

Frequent Co-Authors

Josef Pieprzyk
Josef Pieprzyk Commonwealth Scientific and Industrial Research Organisation
Joseph K. Liu
Joseph K. Liu Monash University
Huaxiong Wang
Huaxiong Wang Nanyang Technological University
Damien Stehlé
Damien Stehlé École Normale Supérieure de Lyon
Surya Nepal
Surya Nepal Commonwealth Scientific and Industrial Research Organisation
Yvo Desmedt
Yvo Desmedt The University of Texas at Dallas
San Ling
San Ling Nanyang Technological University
Yuliang Zheng
Yuliang Zheng University of Alabama at Birmingham
Shujun Li
Shujun Li University of Kent
Man Ho Au
Man Ho Au Hong Kong Polytechnic University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing Computer Science offers several pathways to fit different goals and starting points. For those seeking key technical skills without a long time investment, associates degrees online can provide a fast, flexible start to a tech career. These programs are great for building foundational knowledge and can often transfer to bachelor’s degrees later.

Many students are concerned with costs. Exploring the most affordable online colleges can help reduce financial barriers, making quality education accessible to a broader range of learners. Additionally, students who may have struggled academically in the past can find opportunities with a college that accepts low gpa, removing another common obstacle.

For career advancement, specialized graduate programs matter. Computer Science is often listed among the most useful graduate degrees, with strong demand and competitive salaries across diverse industries. No matter your academic background or future goals, there’s a pathway in Computer Science to help you succeed.

Best Scientists Citing Ron Steinfeld

Trending Scientists

Recently Published Articles