If you made any changes in Pure these will be visible here soon.

Research Output

  • 56 Conference Paper
  • 29 Article
  • 4 Foreword / Postscript
  • 2 Chapter (Book)
Filter
Article
2020

FACCT: FAst, compact, and constant-time discrete Gaussian sampler over Integers

Zhao, R. K., Steinfeld, R. & Sakzad, A., 1 Jan 2020, In : IEEE Transactions on Computers. 69, 1, p. 126-137 12 p., 8834816.

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Geometric range search on encrypted data with Forward/Backward security

Kasra Kermanshahi, S. K., Sun, S-F., Liu, J. K., Steinfeld, R., Nepal, S., Lau, W. F. & Au, M., 23 Mar 2020, (Accepted/In press) In : IEEE Transactions on Dependable and Secure Computing. 18 p.

Research output: Contribution to journalArticleResearchpeer-review

2019

Practical MP-LWE -based encryption balancing security-risk versus efficiency

Steinfeld, R., Sakzad, A. & Zhao, R. K., 12 Dec 2019, In : Designs Codes and Cryptography. 87, 12, p. 2847-2884 38 p.

Research output: Contribution to journalArticleResearchpeer-review

2018

Improved security proofs in lattice-based cryptography: Using the Renyi divergence rather than the statistical distance

Bai, S., Lepoint, T., Roux-Langlois, A., Sakzad, A., Stehle, D. & Steinfeld, R., Apr 2018, In : Journal of Cryptology. 31, 2, p. 610-640 31 p.

Research output: Contribution to journalArticleResearchpeer-review

8 Citations (Scopus)
2017

Hardness of k-LWE and Applications in Traitor Tracing

Ling, S., Phan, D. H., Stehlé, D. & Steinfeld, R., Dec 2017, In : Algorithmica. 79, 4, p. 1318-1352 35 p.

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)
2015

On the linearization of human identification protocols: Attacks based on linear algebra, coding theory, and lattices

Asghar, H. J., Steinfeld, R., Li, S., Kaafar, M. A. & Pieprzyk, J., 2015, In : IEEE Transactions on Information Forensics and Security. 10, 8, p. 1643 - 1655 13 p.

Research output: Contribution to journalArticleResearchpeer-review

6 Citations (Scopus)
2014

A subexponential construction of graph coloring for multiparty computation

Asghar, H. J., Desmedt, Y., Pieprzyk, J. & Steinfeld, R., 2014, In : Journal of Mathematical Cryptology. 8, 4, p. 363 - 403 41 p.

Research output: Contribution to journalArticleResearchpeer-review

Lattice-based certificateless public-key encryption in the standard model

Sepahi, R., Steinfeld, R. & Pieprzyk, J., 2014, In : International Journal of Information Security. 13, 4, p. 315-333 19 p.

Research output: Contribution to journalArticleResearchpeer-review

7 Citations (Scopus)

Lattice-based completely non-malleable public-key encryption in the standard model

Sepahi, R., Steinfeld, R. & Pieprzyk, J., May 2014, In : Designs Codes and Cryptography. 71, 2, p. 293-313 21 p.

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)

Practical attack on NLM-MAC scheme

Orumiehchiha, M. A., Pieprzyk, J. & Steinfeld, R., 2014, In : Information Processing Letters. 114, 10, p. 547 - 550 4 p.

Research output: Contribution to journalArticleOtherpeer-review

2013

Security analysis of linearly filtered NLFSRs

Orumiehchiha, M. A., Pieprzyk, J., Steinfeld, R. & Bartlett, H., 2013, In : Journal of Mathematical Cryptology. 7, 4, p. 313 - 332 20 p.

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)
2012

Cryptanalysis of WG-7: A lightweight stream cipher

Orumiehchiha, M. A., Pieprzyk, J. & Steinfeld, R., 2012, In : Cryptography and Communications: discrete structures, Boolean functions and sequences. 4, 3-4, p. 277 - 285 9 p.

Research output: Contribution to journalArticleResearchpeer-review

18 Citations (Scopus)

Graph coloring applied to secure computation in non-Abelian groups

Desmedt, Y., Pieprzyk, J., Steinfeld, R., Sun, X., Tartary, C., Wang, H. & Yao, A. C-C., 2012, In : Journal of Cryptology. 25, 4, p. 557 - 600 44 p.

Research output: Contribution to journalArticleResearchpeer-review

5 Citations (Scopus)

Multi-party computation with conversion of secret sharing

Ghodosi, H., Pieprzyk, J. & Steinfeld, R., 2012, In : Designs Codes and Cryptography. 62, 3, p. 259 - 272 14 p.

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)

On the modular inversion hidden number problem

Ling, S., Shparlinski, I. E., Steinfeld, R. & Wang, H., 2012, In : Journal of Symbolic Computation. 47, 4, p. 358 - 367 10 p.

Research output: Contribution to journalArticleResearchpeer-review

8 Citations (Scopus)
2007

Chinese remaindering with multiplicative noise

Shparlinski, I. E. & Steinfeld, R., 2007, In : Theory of Computing Systems. 40, 1, p. 33 - 41 9 p.

Research output: Contribution to journalArticleResearchpeer-review

Formal proofs for the security of signcryption

Baek, J., Steinfeld, R. & Zheng, Y., 2007, In : Journal of Cryptology. 20, 2, p. 203 - 235 33 p.

Research output: Contribution to journalArticleResearchpeer-review

99 Citations (Scopus)

Lattice-based threshold changeability for standard Shamir secret-sharing schemes

Steinfeld, R., Pieprzyk, J. & Wang, H., 2007, In : IEEE Transactions on Information Theory. 53, 7, p. 2542 - 2559 18 p.

Research output: Contribution to journalArticleResearchpeer-review

21 Citations (Scopus)
2006

Lattice-based threshold-changeability for standard CRT secret-sharing schemes

Steinfeld, R., Pieprzyk, J. & Wang, H., 2006, In : Finite Fields and their Applications. 12, 4, p. 653 - 680 28 p.

Research output: Contribution to journalArticleResearchpeer-review

22 Citations (Scopus)
2004

Noisy Chinese remaindering in the Lee norm

Shparlinski, I. E. & Steinfeld, R., 2004, In : Journal of Complexity. 20, 2-3, p. 423 - 437 15 p.

Research output: Contribution to journalArticleResearchpeer-review

17 Citations (Scopus)

On the security of RSA with primes sharing least-significant bits

Steinfeld, R. & Zheng, Y., 2004, In : Applicable Algebra in Engineering Communication and Computing. 15, 3-4, p. 179 - 200 22 p.

Research output: Contribution to journalArticleResearchpeer-review

18 Citations (Scopus)
2 Citations (Scopus)
2003

Universal designated-verifier signatures

Steinfeld, R., Bull, L., Wang, H. & Pieprzyk, J., 2003, In : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2894, p. 523-542 20 p.

Research output: Contribution to journalArticleResearchpeer-review

170 Citations (Scopus)
2002

Chinese remaindering for algebraic numbers in a hidden field

Shparlinski, I. E. & Steinfeld, R., 2002, In : Lecture Notes in Computer Science. 2369, p. 349 - 356 8 p.

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Formal proofs for the security of signcryption

Baek, J., Steinfeld, R. & Zheng, Y., 2002, In : Lecture Notes in Computer Science. 2274, p. 80 - 98 19 p.

Research output: Contribution to journalArticleResearchpeer-review

168 Citations (Scopus)

On the necessity of strong assumptions for the security of a class of asymmetric encryption schemes

Steinfeld, R., Baek, J. & Zheng, Y., 2002, In : Lecture Notes in Computer Science. 2384, p. 241 - 256 16 p.

Research output: Contribution to journalArticleResearchpeer-review

4 Citations (Scopus)
2001

An advantage of low-exponent RSA with modules primes sharing least significant bits

Steinfeld, R. & Zheng, Y., 2001, In : Lecture Notes in Computer Science. 2020, p. 52 - 62 11 p.

Research output: Contribution to journalArticleResearchpeer-review

Content extraction signatures

Steinfeld, R., Bull, L. & Zheng, Y., 2001, In : Lecture Notes in Computer Science. 2288, p. 285 - 304 20 p.

Research output: Contribution to journalArticleResearchpeer-review

2000

A Signcryption Scheme Based on Integer Factorization

Steinfeld, R. & Zheng, Y., 2000, In : Lecture Notes in Computer Science. p. 308 - 322 15 p.

Research output: Contribution to journalArticleResearchpeer-review

67 Citations (Scopus)