Ron Steinfeld

Orcid: 0000-0003-1745-4183

According to our database1, Ron Steinfeld authored at least 143 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
High Throughput Lattice-Based Signatures on GPUs: Comparing Falcon and Mitaka.
IEEE Trans. Parallel Distributed Syst., April, 2024

Fast and private multi-dimensional range search over encrypted data.
Inf. Sci., January, 2024

Quantum-Safe HIBE: Does It Cost a Latte?
IEEE Trans. Inf. Forensics Secur., 2024

DualRing-PRF: Post-Quantum (Linkable) Ring Signatures from Legendre and Power Residue PRFs.
IACR Cryptol. ePrint Arch., 2024

Loquat: A SNARK-Friendly Post-Quantum Signature based on the Legendre PRF with Applications in Ring and Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2024

Modeling Mobile Crash in Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2024

Plover: Masking-Friendly Hash-and-Sign Lattice Signatures.
IACR Cryptol. ePrint Arch., 2024

2023
A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions.
ACM Comput. Surv., December, 2023

Guest editorial: Special issue on Mathematics of Zero-Knowledge.
Des. Codes Cryptogr., November, 2023

Incremental symmetric puncturable encryption with support for unbounded number of punctures.
Des. Codes Cryptogr., April, 2023

Energy Consumption Evaluation of Post-Quantum TLS 1.3 for Resource-Constrained Embedded Devices.
IACR Cryptol. ePrint Arch., 2023

ACE: A Consent-Embedded privacy-preserving search on genomic database.
CoRR, 2023

Post-Quantum Zero-Knowledge Proofs and Applications.
Proceedings of the 10th ACM Asia Public-Key Cryptography Workshop, 2023

A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

2022
Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation.
IEEE Trans. Dependable Secur. Comput., 2022

Practical Encrypted Network Traffic Pattern Matching for Secure Middleboxes.
IEEE Trans. Dependable Secur. Comput., 2022

Geometric Range Search on Encrypted Data With Forward/Backward Security.
IEEE Trans. Dependable Secur. Comput., 2022

Range search on encrypted spatial data with dynamic updates.
J. Comput. Secur., 2022

Private Re-Randomization for Module LWE and Applications to Quasi-Optimal ZK-SNARKs.
IACR Cryptol. ePrint Arch., 2022

Garrison: A Novel Watchtower Scheme for Bitcoin.
IACR Cryptol. ePrint Arch., 2022

Daric: A Storage Efficient Payment Channel With Penalization Mechanism.
IACR Cryptol. ePrint Arch., 2022

Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications.
IACR Cryptol. ePrint Arch., 2022

Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs.
IACR Cryptol. ePrint Arch., 2022

A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum.
IACR Cryptol. ePrint Arch., 2022

An Injectivity Analysis of CRYSTALS-Kyber and Implications on Quantum Security.
IACR Cryptol. ePrint Arch., 2022

Post-Quantum ID-based Ring Signatures from Symmetric-key Primitives.
IACR Cryptol. ePrint Arch., 2022

A Survey on Exotic Signatures for Post-Quantum Blockchain: Challenges & Research Directions.
IACR Cryptol. ePrint Arch., 2022

Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems.
Des. Codes Cryptogr., 2022

MatRiCT<sup>+</sup>: More Efficient Post-Quantum Private Blockchain Payments.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Daric: A Storage Efficient Payment Channel with Punishment Mechanism.
Proceedings of the Information Security - 25th International Conference, 2022

Performance Evaluation of Post-Quantum TLS 1.3 on Resource-Constrained Embedded Systems.
Proceedings of the Information Security Practice and Experience, 2022

PRESSGenDB: PRivacy-prEserving Substring Search on Encrypted Genomic DataBase.
Proceedings of the IEEE INFOCOM 2022, 2022

2021
Multi-Client Cloud-Based Symmetric Searchable Encryption.
IEEE Trans. Dependable Secur. Comput., 2021

FPPW: A Fair and Privacy Preserving Watchtower For Bitcoin.
IACR Cryptol. ePrint Arch., 2021

Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security.
IACR Cryptol. ePrint Arch., 2021

Performance Evaluation of Post-Quantum TLS 1.3 on Embedded Systems.
IACR Cryptol. ePrint Arch., 2021

MatRiCT+: More Efficient Post-Quantum Private Blockchain Payments.
IACR Cryptol. ePrint Arch., 2021

On the Integer Polynomial Learning with Errors Problem.
IACR Cryptol. ePrint Arch., 2021

Lattice-based zero-knowledge arguments for additive and multiplicative relations.
Des. Codes Cryptogr., 2021

PrivGenDB: Efficient and privacy-preserving query executions over encrypted SNP-Phenotype database.
CoRR, 2021

Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy.
Proceedings of the 28th Annual Network and Distributed System Security Symposium, 2021

A Non-interactive Multi-user Protocol for Private Authorised Query Processing on Genomic Data.
Proceedings of the Information Security - 24th International Conference, 2021

Massive MIMO Physical Layer Cryptosystem: Bob cannot decrypt uniquely!
Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

Geo-DRS: Geometric Dynamic Range Search on Spatial Data with Backward and Content Privacy.
Proceedings of the Computer Security - ESORICS 2021, 2021

Collaborative analysis of genomic data: vision and challenges.
Proceedings of the 7th IEEE International Conference on Collaboration and Internet Computing, 2021

Transparency or Anonymity Leak: Monero Mining Pools Data Publication.
Proceedings of the Information Security and Privacy - 26th Australasian Conference, 2021

2020
FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers.
IEEE Trans. Computers, 2020

Post-Quantum Linkable Ring Signature Enabling Distributed Authorised Ring Confidential Transactions in Blockchain.
IACR Cryptol. ePrint Arch., 2020

Public-Key Puncturable Encryption: Modular and Compact Constructions.
IACR Cryptol. ePrint Arch., 2020

Foxtail+: A Learning with Errors-based Authentication Protocol for Resource-Constrained Devices.
IACR Cryptol. ePrint Arch., 2020

Towards Practical Encrypted Network Traffic Pattern Matching for Secure Middleboxes.
IACR Cryptol. ePrint Arch., 2020

Practical Post-Quantum Few-Time Verifiable Random Function with Applications to Algorand.
IACR Cryptol. ePrint Arch., 2020

MPSign: A Signature from Small-Secret Middle-Product Learning with Errors.
IACR Cryptol. ePrint Arch., 2020

Comments on "Physical-layer cryptography through massive MIMO".
CoRR, 2020

Efficient Lattice-Based Polynomial Evaluation and Batch ZK Arguments.
Proceedings of the Selected Areas in Cryptography - SAC 2020, 2020

COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

2019
Compact and Scalable Arbitrary-centered Discrete Gaussian Sampling over Integers.
IACR Cryptol. ePrint Arch., 2019

Lattice RingCT v2.0 with Multiple Input and Output Wallets.
IACR Cryptol. ePrint Arch., 2019

Practical MP-LWE-based encryption balancing security-risk vs. efficiency.
IACR Cryptol. ePrint Arch., 2019

MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol.
IACR Cryptol. ePrint Arch., 2019

Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications.
IACR Cryptol. ePrint Arch., 2019

Practical $$\mathsf {MP} \text{- }\mathsf {LWE} $$ -based encryption balancing security-risk versus efficiency.
Des. Codes Cryptogr., 2019

Generic Multi-keyword Ranked Search on Encrypted Cloud Data.
Proceedings of the Computer Security - ESORICS 2019, 2019

DGM: A Dynamic and Revocable Group Merkle Signature.
Proceedings of the Computer Security - ESORICS 2019, 2019

Revocable and Linkable Ring Signature.
Proceedings of the Information Security and Cryptology - 15th International Conference, 2019

Multi-Writer Searchable Encryption: An LWE-based Realization and Implementation.
Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, 2019

On The Unforkability of Monero.
Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, 2019

Senarai: A Sustainable Public Blockchain-Based Permanent Storage Protocol.
Proceedings of the Cryptology and Network Security - 18th International Conference, 2019

Designing Smart Contract for Electronic Document Taxation.
Proceedings of the Cryptology and Network Security - 18th International Conference, 2019

Risk of Asynchronous Protocol Update: Attacks to Monero Protocols.
Proceedings of the Information Security and Privacy - 24th Australasian Conference, 2019

Lattice RingCT V2.0 with Multiple Input and Multiple Output Wallets.
Proceedings of the Information Security and Privacy - 24th Australasian Conference, 2019

2018
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance.
J. Cryptol., 2018

Platform-independent Secure Blockchain-Based Voting System.
IACR Cryptol. ePrint Arch., 2018

Monero Ring Attack: Recreating Zero Mixin Transaction Effect.
IACR Cryptol. ePrint Arch., 2018

Post-Quantum One-Time Linkable Ring Signature and Application to Ring Confidential Transactions in Blockchain (Lattice RingCT v1.0).
IACR Cryptol. ePrint Arch., 2018

Result Pattern Hiding Searchable Encryption for Conjunctive Queries.
IACR Cryptol. ePrint Arch., 2018

Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures.
IACR Cryptol. ePrint Arch., 2018

Anonymity Reduction Attacks to Monero.
Proceedings of the Information Security and Cryptology - 14th International Conference, 2018

Practical Backward-Secure Searchable Encryption from Symmetric Puncturable Encryption.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Middle-Product Learning With Errors.
IACR Cryptol. ePrint Arch., 2017

All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE.
IACR Cryptol. ePrint Arch., 2017

Hardness of k-LWE and Applications in Traitor Tracing.
Algorithmica, 2017

A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties.
Proceedings of the Information Security Practice and Experience, 2017

Multi-user Cloud-Based Secure Keyword Search.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

An implementation of access-control protocol for IoT home scenario.
Proceedings of the 16th IEEE/ACIS International Conference on Computer and Information Science, 2017

2016
An Efficient Non-Interactive Multi-client Searchable Encryption with Support for Boolean Queries.
IACR Cryptol. ePrint Arch., 2016

Trusted Boolean Search on Cloud Using Searchable Symmetric Encryption.
Proceedings of the 2016 IEEE Trustcom/BigDataSE/ISPA, 2016

Anonymizing Bitcoin Transaction.
Proceedings of the Information Security Practice and Experience, 2016

2015
On the Linearization of Human Identification Protocols: Attacks Based on Linear Algebra, Coding Theory, and Lattices.
IEEE Trans. Inf. Forensics Secur., 2015

Rotational Cryptanalysis of ARX Revisited.
IACR Cryptol. ePrint Arch., 2015

Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.
IACR Cryptol. ePrint Arch., 2015

On massive MIMO physical layer cryptosystem.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
Practical attack on NLM-MAC scheme.
Inf. Process. Lett., 2014

Lattice-based certificateless public-key encryption in the standard model.
Int. J. Inf. Sec., 2014

GGHLite: More Efficient Multilinear Maps from Ideal Lattices.
IACR Cryptol. ePrint Arch., 2014

Algebraic Attacks on Human Identification Protocols.
IACR Cryptol. ePrint Arch., 2014

A Subexponential Construction of Graph Coloring for Multiparty Computation.
IACR Cryptol. ePrint Arch., 2014

Lattice-based completely non-malleable public-key encryption in the standard model.
Des. Codes Cryptogr., 2014

2013
Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices.
IACR Cryptol. ePrint Arch., 2013

Cryptanalysis of RC4(n, m) Stream Cipher.
IACR Cryptol. ePrint Arch., 2013

Security Analysis of Linearly Filtered NLFSRs.
IACR Cryptol. ePrint Arch., 2013

Breaking NLM-MAC Generator.
IACR Cryptol. ePrint Arch., 2013

Truncated Differential Analysis of Reduced-Round LBlock.
Proceedings of the Cryptology and Network Security - 12th International Conference, 2013

2012
On the modular inversion hidden number problem.
J. Symb. Comput., 2012

Graph Coloring Applied to Secure Computation in Non-Abelian Groups.
J. Cryptol., 2012

Security Evaluation of Rakaposhi Stream Cipher.
IACR Cryptol. ePrint Arch., 2012

Does Counting Still Count? Revisiting the Security of Counting based User Authentication Protocols against Statistical Attacks.
IACR Cryptol. ePrint Arch., 2012

Multi-party computation with conversion of secret sharing.
Des. Codes Cryptogr., 2012

Cryptanalysis of WG-7: a lightweight stream cipher.
Cryptogr. Commun., 2012

Active Security in Multiparty Computation over Black-Box Groups.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Cryptanalysis of RC4-Based Hash Function.
Proceedings of the Tenth Australasian Information Security Conference, 2012

2011
Cryptanalysis of WG-7 (A Lightweight Stream Cipher for RFID Encryption).
IACR Cryptol. ePrint Arch., 2011

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Lattice-Based Completely Non-malleable PKE in the Standard Model (Poster).
Proceedings of the Information Security and Privacy - 16th Australasian Conference, 2011

2010
Security for Signcryption: The Multi-User Model.
Proceedings of the Practical Signcryption, 2010

Faster Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2010

Known and Chosen Key Differential Distinguishers for Block Ciphers.
Proceedings of the Information Security and Cryptology - ICISC 2010, 2010

2009
Efficient Public Key Encryption Based on Ideal Lattices.
IACR Cryptol. ePrint Arch., 2009

Efficient Fuzzy Matching and Intersection on Private Datasets.
Proceedings of the Information, Security and Cryptology, 2009

2008
Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits.
IACR Cryptol. ePrint Arch., 2008

2007
Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes.
IEEE Trans. Inf. Theory, 2007

Chinese Remaindering with Multiplicative Noise.
Theory Comput. Syst., 2007

Formal Proofs for the Security of Signcryption.
J. Cryptol., 2007

Cryptanalysis of LASH.
IACR Cryptol. ePrint Arch., 2007

New constructions of anonymous membership broadcasting schemes.
Adv. Math. Commun., 2007

How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature.
Proceedings of the Topics in Cryptology, 2007

On Secure Multi-party Computation in Black-Box Groups.
Proceedings of the Advances in Cryptology, 2007

2006
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator.
IACR Cryptol. ePrint Arch., 2006

Lattice-based threshold-changeability for standard CRT secret-sharing schemes.
Finite Fields Their Appl., 2006

Higher Order Universal One-Way Hash Functions from the Subset Sum Assumption.
Proceedings of the Public Key Cryptography, 2006

A Non-malleable Group Key Exchange Protocol Robust Against Active Insiders.
Proceedings of the Information Security, 9th International Conference, 2006

2005
VSH, an Efficient and Provable Collision Resistant Hash Function.
IACR Cryptol. ePrint Arch., 2005

Converse Results to the Wiener Attack on RSA.
Proceedings of the Public Key Cryptography, 2005

2004
Noisy Chinese remaindering in the Lee norm.
J. Complex., 2004

On the Security of RSA with Primes Sharing Least-Significant Bits.
Appl. Algebra Eng. Commun. Comput., 2004

2003
Efficient Extension of Standard Schnorr/RSA signatures into Universal Designated-Verifier Signatures.
IACR Cryptol. ePrint Arch., 2003

Universal Designated-Verifier Signatures.
IACR Cryptol. ePrint Arch., 2003

2002
Content Extraction Signatures.
IACR Cryptol. ePrint Arch., 2002

Chinese Remaindering for Algebraic Numbers in a Hidden Field.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

On the Necessity of Strong Assumptions for the Security of a Class of Asymmetric Encryption Schemes.
Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

2001
An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits.
Proceedings of the Topics in Cryptology, 2001

2000
A Signcryption Scheme Based on Integer Factorization.
Proceedings of the Information Security, Third International Workshop, 2000


  Loading...