Ron Steinfeld’s Research Papers

 

JOURNAL PAPERS

 

·        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 (full version): ps  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 (full version): ps  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 (full version): ps  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 (full version): ps  pdf

 

·        I.E. Shparlinski and R. Steinfeld. Noisy Chinese Remaindering in the Lee Norm. Journal of Complexity, Vol. 20, pp. 423-437, 2004.

Download (full version): ps  pdf

 

REFEREED CONFERENCE PAPERS

 

·        S. Contini and K. Matusiewicz and J. Pieprzyk and Ron Steinfeld and Guo Jian and Ling San and Huaxiong Wang. Cryptanalysis of LASH. In Proceedings of FSE 2008, LNCS, 2008. To Appear.

Download (full version): 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 (full version): 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 (full version): ps  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 (full version): ps  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 (full version): ps  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 (full version): ps  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 (full version): ps  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 (full version): ps  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 (full version): ps  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

·        Centre for Advanced Computing – Algorithms and Cryptography