Ron Steinfeld

Ron Steinfeld’s Research Papers

BOOK CHAPTERS / SURVEYS

R. Steinfeld. NTRU Cryptosystem: Recent Developments and Emerging Mathematical Problems in Finite Polynomial Rings. Chapter of Algebraic Curves and Finite Fields: Cryptography and Other Applications, H. Niederreiter and A. Ostafe and D. Panario and A. Winterhof (Eds.), Radon Series on Computational and Applied Mathematics, Volume 16, De Gruyter, 2014, ISBN 978-3-11-031788-6. Download: pdf
J. Baek and R. Steinfeld. Security for Signcryption: The Multi-User Model. Chapter of Practical Signcryption, A. Dent and Y. Zheng (Eds.). 274 pages. Springer-Verlag, 2010, ISBN: 978-3-540-89409-4.
R. Steinfeld. The Current Status in Design of Efficient Provably Secure Cryptographic Pseudorandom Generators. Chapter of Coding and Cryptology, Y. Li and S. Ling and H. Niederreiter and H. Wang and C. Xing and S. Zhang (Eds.). 288 pages. World Scientific Publishing, 2008, ISBN: 981-283-223-8. Download: pdf
S. Contini and R. Steinfeld and J. Pieprzyk and K. Matusiewicz. A Critical Look at Cryptographic Hash Function Literature. Chapter of Coding and Cryptology, Y. Li and S. Ling and H. Niederreiter and H. Wang and C. Xing and S. Zhang (Eds.). 288 pages. World Scientific Publishing, 2008, ISBN: 981-283-223-8.
I.E. Shparlinski and R. Steinfeld. Collision in the DSA Function. Chapter of Coding and Cryptology, Y. Li and S. Ling and H. Niederreiter and H. Wang and C. Xing and S. Zhang (Eds.). 288 pages. World Scientific Publishing, 2008, ISBN: 981-283-223-8.

JOURNAL PAPERS

R. Sepahi and R. Steinfeld and J. Pieprzyk. Lattice-Based Completely Non-Malleable Public-Key Encryption in the Standard Model. Designs Codes and Cryptography, Vol. 71, No. 2, pp. 293-313, Springer, 2014.
M.A. Orumiehchiha and J. Pieprzyk and R. Steinfeld and H. Bartlett. Security analysis of linearly filtered NLFSRs. Journal of Mathematical Cryptology, Vol. 7, No. 4, pp. 313-332, 2013.
D. Stehlé and R. Steinfeld. Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices. Submitted, Nov. 2012. Download: pdf
Y. Desmedt and J. Pieprzyk and R. Steinfeld and X. Sun and C. Tartary and H. Wang. Graph Coloring Applied to Secure Computation in Non-Abelian Groups. Journal of Cryptology, 2012, To Appear.
H. Ghodossi and J. Pieprzyk and R. Steinfeld. Multi-Party Computation with Conversion of Secret Sharing. Designs Codes and Cryptography, Vol. 62, No. 3, pp. 259-272, 2012.
S. Ling and I.E. Shparlinski and R. Steinfeld and H. Wang. On the Modular Inversion Hidden Number Problem. Journal of Symbolic Computation, 2012, To Appear. Download: pdf
R. Steinfeld and J. Pieprzyk and H. Wang. Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes. IEEE Transactions on Information Theory, Vol. 53, No. 7, pp. 2542-2559, 2007. Download: pdf
J. Baek and R. Steinfeld and Y. Zheng. Formal Proofs for the Security of Signcryption, Journal of Cryptology, Vol. 20, No. 2, pp. 203-235, 2007.
I.E. Shparlinski and R. Steinfeld. Chinese Remaindering with Multiplicative Noise. Theory of Computing Systems, Vol. 40, No. 1, pp. 33-41, 2007. Download: pdf
R. Steinfeld and J. Pieprzyk and H. Wang. Lattice-Based Threshold-Changeability for Standard CRT Secret-Sharing Schemes. Finite Fields and their Applications, Vol. 12, pp. 653-680, 2006. Download: pdf
R. Steinfeld and Y. Zheng. On the Security of RSA with Primes Sharing Least-Significant Bits. Applicable Algebra in Engineering, Communication and Computing,Vol. 15, pp. 179-200, 2004. Download: pdf
I.E. Shparlinski and R. Steinfeld. Noisy Chinese Remaindering in the Lee Norm. Journal of Complexity, Vol. 20, pp. 423-437, 2004. Download: pdf

REFEREED CONFERENCE PAPERS

S. Ling and D.H. Phan and D. Stehlé and R. Steinfeld. Hardness of k-LWE and Applications in Traitor Tracing. In Proceedings of CRYPTO 2014, Springer-Verlag, 2014 (To appear). Full version: pdf
A. Langlois and D. Stehlé and R. Steinfeld. GGHLite: More Efficient Multilinear Maps from Ideal Lattices.. In Proceedings of EUROCRYPT 2014, LNCS Vol. 8441, pp. 239-256, Springer-Verlag, 2014. Full version: pdf
S. Emami and C. McDonald and J. Pieprzyk and R. Steinfeld. Truncated Differential Analysis of Reduced-Round LBlock. In Proceedings of CANS 2013, LNCS Vol. 8257, Springer-Verlag, 2013.
M.A. Orumiehchiha and J. Pieprzyk and E. Shakour and R. Steinfeld. Cryptanalysis of RC4(n, m) stream cipher. In Proceedings of SIN 2013, pp. 165-172, ACM, 2013.
H.J. Asghar and S. Li and R. Steinfeld and J. Pieprzyk. Does Counting Still Count? Revisiting the Security of Counting based User Authentication Protocols against Statistical Attacks. In Proceedings of NDSS 2013, The Internet Society, 2013. Full version: pdf
M.A. Orumiehchiha and J. Pieprzyk and E. Shakour and R. Steinfeld. Security Evaluation of Rakaposhi Stream Cipher. In Proceedings of ISPEC 2013, LNCS Vol. 7863, Springer-Verlag, pp. 361-371, 2013.
Y. Desmedt and J. Pieprzyk and R. Steinfeld. Active Security in Multiparty Computation over Black-Box Groups. In Proceedings of SCN 2012, LNCS Vol. 7485, Springer-Verlag, pp. 503-521, 2012. Conference version: pdf
R. Steinfeld and S. Ling and J. Pieprzyk and C. Tartary and H. Wang. NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model.. In Proceedings of PKC 2012, LNCS Vol. 7293, pp. 353-371, Springer-Verlag, 2012. Conference version: pdf
S. Emami and P. Gauravaram and J. Pieprzyk and R. Steinfeld. (Chosen-multi-target) preimage attacks on reduced Grøstl-0. Submitted. Download: pdf
D. Stehlé and R. Steinfeld. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. In Proceedings of EUROCRYPT 2011, LNCS Vol. 6632, pp. 27-47, Springer-Verlag, 2011. Conference version: pdf, Full Version: pdf

I. Nikolic and J. Pieprzyk and P. Sokolowski and R. Steinfeld. Known and Chosen Key Di.erential Distinguishers for Block Ciphers. In Proceedings of ICISC 2010, LNCS, Springer-Verlag. Conference version: pdf
D. Stehlé and R. Steinfeld. Faster Fully Homomorphic Encryption. In Proceedings of ASIACRYPT 2010, LNCS Vol. 6477, pp. 377-394, Springer-Verlag, 2010. Download: pdf
D. Stehlé and R. Steinfeld and K. Tanaka and K. Xagawa. Efficient Public Key Encryption Based on Ideal Lattices. In Proceedings of ASIACRYPT 2009, LNCS Vol. 5912, pp. 617-635, Springer-Verlag, 2009. Download: pdf
Q. Ye and R. Steinfeld and J. Pieprzyk and H. Wang. Efficient Fuzzy Matching and Intersection on Private Datasets.. In Proceedings of ICISC 2009, LNCS Vol. 5984, Springer-Verlag, 2010. Download: pdf
R. Steinfeld and S. Contini and K. Matusiewicz and J. Pieprzyk and G. Jian and S. Ling and H. Wang. Cryptanalysis of LASH. In Proceedings of FSE 2008, LNCS Vol. 5086, pp. 207-223, 2008. Download: pdf
Y. Desmedt and J. Pieprzyk and R. Steinfeld and H. Wang. On Secure Multiparty Protocols in Black Box Groups. In Proceedings of CRYPTO 2007, LNCS Vol. 4622, pp. 591-612, Springer-Verlag, 2007. Download: pdf
R. Steinfeld and J. Pieprzyk and H. Wang. How to Strengthen any Weakly Unforgeble Signature into a Strongly Unforgeable Signature. In Proceedings of CT-RSA 2007, LNCS Vol. 4377, pp. 357-371, Springer-Verlag, 2007. Download: pdf
R. Steinfeld and J. Pieprzyk and H. Wang. On the Provable Security of an Efficient RSA-Based Pseudorandom Generator. In Proceedings of ASIACRYPT 2006, Lecture Notes in Computer Science,Vol. 4284, pp. 194-209, Springer-Verlag, 2006. Download: pdf
Y. Desmedt and J. Pieprzyk and R. Steinfeld and H. Wang. A Non-Malleable Group Key Exchange Protocol Robust Against Active Insiders. In Proceedings of ISC 2006, Lecture Notes in Computer Science,Vol. 4176, pp. 459-475, Springer-Verlag, 2006.
R. Steinfeld and J. Pieprzyk and H. Wang. Higher Order Universal One-Way Hash Functions from the Subset Sum Assumption. In Proceedings of PKC 2006, Lecture Notes in Computer Science, pp. 157-173, Springer Verlag, 2006. Download: pdf
S. Contini, A. Lenstra, and R. Steinfeld. VSH, an Efficient and Provable Collision Resistant Hash Function. In Proceedings of EUROCRYPT 2006, Lecture Notes in Computer Science, pp. 165-182, Springer Verlag, 2006. Also presented at the first NIST hash function workshop, 2005. Download: pdf
R. Steinfeld and S. Contini and H. Wang and J. Pieprzyk. Converse Results to the Wiener Attack on RSA. In Proceedings of PKC 2005, Lecture Notes in Computer Science, pp. 184-198, Springer-Verlag, 2005. Download: pdf
R. Steinfeld and H. Wang and J. Pieprzyk. Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes. In Proceedings of ASIACRYPT 2004, Lecture Notes in Computer Science,Vol. 3329, pp. 170-186, Springer-Verlag, 2004.
R. Steinfeld, H. Wang and J. Pieprzyk. Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures. In Proceedings of PKC 2004, Lecture Notes in Computer Science, Vol. 2947, pp. 86-100, Springer-Verlag, 2004. Download: pdf
R. Steinfeld, L. Bull, H. Wang and J. Pieprzyk. Universal Designated-Verifier Signatures. In Proceedings of ASIACRYPT 2003, Lecture Notes in Computer Science, Vol. 2894, pp. 523-542, Springer-Verlag, 2003. Download: pdf
I.E. Shparlinski and R. Steinfeld. Chinese Remaindering for Algebraic Numbers in Hidden Field. In Proceedings of Algorithmic Number Theory Symposium V (ANTS V), Lecture Notes in Computer Science, vol. 2369, pp. 349-356, Springer-Verlag, 2002.
R. Steinfeld and J. Baek and Y. Zheng. On the Necessity of Strong Assumptions for the Security of a Class of Asymmetric Encryption Schemes. In Proceedings of Australasian Conference on Information Security and Privacy 2002 (ACISP 2002), Lecture Notes in Computer Science, vol. 2384, pp. 241-256, Springer-Verlag, 2002.
J. Baek, R. Steinfeld and Y. Zheng. Formal Proofs for The Security of Signcryption. In Proceedings of Public Key Cryptography Conference 2002 (PKC 2002), Lecture Notes in Computer Science, vol. 2274, pp. 80-98, Springer-Verlag, 2002.
R. Steinfeld, L. Bull and Y. Zheng. Content Extraction Signatures. In Proceedings of International Conference on Information Security and Cryptology 2001 (ICISC 2001), Lecture Notes in Computer Science, vol. 2288, pp. 285-304, Springer-Verlag, 2002.
R. Steinfeld, Y. Zheng. An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least-Significant Bits. In Proceedings of Cryptographers' Track RSA Conference 2001 (CT-RSA 2001), Lecture Notes in Computer Science, vol. 2020, pp. 52-61, Springer-Verlag, 2001.
R. Steinfeld, Y. Zheng. A Signcryption Scheme Based on Integer Factorization. In Proceedings of Information Security Workshop 2000 (ISW2000), Lecture Notes in Computer Science, vol. 1975, pp. 308-322, Springer-Verlag, 2000.

· Ron Steinfeld's Home Page