HomeAbout UsPeopleResearchPublicationsSeminarsEventsAwardsPositionsContact Us
 


publications 2011

Journal Papers

  1. H. J. Asghar, J. Pieprzyk, H. Wang. (2011). On the Hardness of the Sum of $k$ Mins Problem. The Computer Journal, vol. 54, no. 10, pp. 1652 -1660.

  2. C. Xing. (2011). Asymptotically good nonlinear codes from algebraic curves. IEEE Transactions on Information Theory, vol. 57, no. 9, pp. 5991 – 5995.

  3. C. Tartary, H. Wang, S. Ling. (2011). Authentication of Digital Streams. IEEE Transactions on Information Theory, vol. 57, no. 9, pp. 6285 – 6303.

  4. M. F. Ezerman, S. Ling, P. Sole. (2011). Additive Asymmetric Quantum Codes. IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 5536 – 5550. [PDF]

  5. C. Tartary, H. Wang, Y. Zhang. (2011). An Efficient and Information Theoretic Secure Rational Secret Sharing Scheme Based on Bivariate Polynomials. International Journal of Foundations of Computer Science (Special Issue on Cryptography), vol. 22, no. 6, pp 1395 - 1416.

  6. N. Koblitz, A. Menezes, I. Shparlinski. (2011). Discrete Logarithms, Diffie-Hellman, and Reductions. Vietnam Journal of Mathematics, vol. 39, pp. 267–285.

  7. A. Ostafe, I. Shparlinski. (2011). On the Waring problem with Dickson polynomials in finite fields. Proceedings of the American Mathematical Society, vol. 139, pp. 3815-3820.

  8. J. Pieprzyk, H. Wang, X. Zhang. (2011). Mobius Transforms, Coincident  Boolean Functions and Noncoincidence Property of Boolean Functions. International Journal of Computer Mathematics, vol. 88, no. 7, pp. 1398 - 1416.

  9. A. B. F. Edoukou, S. Ling, C. Xing. (2011). Structure of functional codes defined on non-degenerate Hermitian varieties.  Journal of Combinatorial Theory, Series A, vol. 118, pp. 2436 – 2444.

  10. V. Skachek. (2011). Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming. IEEE Transactions on Information Theory, vol. 57 (6), pp. 3698 - 3706.

  11. A. Pott, Y. Tan, T. Feng, S. Ling. (2011). Association schemes arising from bent functions. Designs, Codes and Cryptography, vol. 59, 319 – 331.

  12. Y. Jia, S. Ling, C. Xing. (2011). On Self-Dual Cyclic Codes over Finite Fields. IEEE Transactions on Information Theory, vol. 57, pp. 2243 – 2251.

  13. J. Crampton, H. W. Lim, K. G. Paterson, G. Price. (2011). User-Friendly and Certificate-Free Grid Security Infrastructure. International Journal of Information Security (IJIS), vol. 10, no. 3, pp. 137-153.

  14. J. Weber, K.A.S. Immink. (2011). Knuth’s Balanced Codes Revisited. IEEE Transactions on Information Theory, vol. 56, no. 4, pp. 673-1679.

  15. Y. M. Chee, G. Ge, L. Ji, S. Ling, J. Yin. (2011). List decodability at small radii. Designs, Codes, and Cryptography, vol. 61, no. 2, pp. 151–166. [PDF]

  16. J.-C. Bermond, Y. M. Chee, N. Cohen, X. Zhang. (2011). The α--arboricity of complete uniform hypergraphs. SIAM Journal on Discrete Mathematics, vol. 34, no. 2, pp. 600 - 610. [PDF]

  17. Y. M. Chee, Y. Tan, X. Zhang. (2011). Strongly regular graphs constructed from p-ary bent functions. Journal of Algebraic Combinatorics, vol. 34, no. 2, pp. 251 - 266. [PDF]

  18. A. Poschmann, A. Moradi, K. Khoo, C.-W. Lim, H. Wang, S. Ling. (2011). Side-channel resistant crypto for less than 2,300 GE. Journal of Cryptology, vol. 24, no. 2, pp. 322 -345.

  19. R. Blackburn, A. Ostafe, I. Shparlinski. (2011). On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. Uniform Distribution Theory, vol. 6, no.1, pp. 127–142.

  20. Y. Chang, Y. M. Chee, J. Zhou. (2011). A pair of disjoint 3-GDDs of type g^t u^1. Designs, Codes, and Cryptography, vol. 60, no. 1, pp. 37 - 62. [PDF]

  21. Y. M. Chee, X. Zhang, H. Zhang. (2011). Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order. Advances in Mathematics of Communications, vol. 5, no. 1, pp. 59–68. [PDF]

  22. M. F. Ezerman, S. Ling, P. Sole, O. Yemen. (2011). From Skew-Cyclic Codes to Asymmetric Quantum Codes. Advances in Mathematics of Communications, Vol. 5, No. 1, 41 - 57. [PDF]

  23. C. Xing, S. L. Yeo. (2011). Gilbert-Varshamov type bound for lattice packings. J. of Combinatorial Theory, Series A, 118, 938–948.

  24. H. W. Lim, K. G. Paterson. (2011). Identity-Based Cryptography for Grid Security. International Journal of Information Security (IJIS), vol. 10, no. 1, pp. 15-32.

  25. M. F. Ezerman, M. Grassl, P. Sol´e. (2011). The Weights in MDS Codes. IEEE Transactions on Information Theory, vol. 57, no. 1, pp. 392–396.

Conference Papers

  1. P. H. Nguyen, M. J. B. Robshaw, H. Wang. (2011). On Related-Key Attacks and KASUMI: The Case of A5/3. In Proceedings of the 12th International Conference on Cryptology (Indocrypt 2011), Lecture Notes in Computer Science, vol. 7107, pp. 146-159, Springer.

  2. H. Yap, K. Khoo, A. Poschmann, M. Henricksen. (2011). EPCBC - A Block Cipher Suitable for Electronic Product Code Encryption. In Proceedings of the 10th International Conference on Cryptology and Network Security (CANS 2011), Lecture Notes in Computer Science, vol. 7092, pp. 76-97, Springer.

  3. O. Farràs, C. Padró, C. Xing, A. Yang. (2011). Natural Generalizations of Threshold Secret Sharing. In Proceedings of Advances in Cryptology (Asiacrypt 2011), Lecture Notes in Computer Science, vol. 7073, pp. 610-627, Springer.

  4. Y. Deng, D. Feng, V. Goyal, D. Lin, A. Sahai, M. Yung. (2011). Resettable Cryptography in Constant Rounds -- the Case of Zero Knowledge. In Proceedings of Asiacrypt 2011, Lecture Notes in Computer Science, vol. 7073, pp. 390-406, Springer.

  5. N. Markin, F. Oggier. (2011). Iterated MIDO space-time code constructions. In Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton Conference 2011), pp. 539 – 544.

  6. J. Guo, T. Peyrin, A. Poschmann, M. Robshaw. (2011). The LED Block Cipher. In Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems 2011 (CHES 2011), Lecture Notes in Computer Science, vol. 6917, pp. 326-341, Springer.

  7. M. F. Ezerman, S. Jitman, S. Ling. (2011). Pure Asymmetric Quantum MDS Codes from CSS Construction. In Proceedings of the 3rd International Castle Meeting on Coding Theory and Applications (3ICMCTA) 2011, Castell de Cardona, (Eds. Joaquim Borges, Mercè Villanueva), pp. 99 – 104.

  8. D. H. Tran, W. K. Ng, H. W. Lim, H. Nguyen. (2011). An Efficient Cacheable Secure Scalar Product Protocol for Privacy-Preserving Data Mining. In, A. Cuzzocrea and U. Dayal, Proceedings of the 13th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2011), Lecture Notes in Computer Science, vol. 6862, pp. 354-366, Springer-Verlag.

  9. I. Cascudo, R. Cramer, C. Xing. (2011). The torsion-limit for algebraic function fields and its application to arithmetic secret sharing. In Proceedings of the Advances in Cryptology (CRYPTO 2011), vol. 6841, pp. 685–705.

  10. J. Guo, T. Peyrin, A. Poschmann. (2011). The PHOTON Family of Lightweight Hash Functions. In Proceedings of the Advances in Cryptology (CRYPTO 2011), vol. 6841, pp. 222-239.

  11. L. Luzzi, F. Oggier. (2011). A family of fast-decodable MIDO codes from crossed-product algebras over Q. In Proceedings of the ISIT 2011, St Petersburg, Russia, pp. 2169-2173.

  12. S. H. Dau, V. Skachek, Y. M. Chee. (2011). Index coding and error correction. In ISIT 2011 – Proceedings of the 2011 IEEE International Symposium on Information Theory, pp. 1753–1757. [PDF]

  13. S. H. Dau, V. Skachek, Y. M. Chee. (2011). On secure index coding with side information. In ISIT 2011 – Proceedings of the 2011 IEEE International Symposium on Information Theory, pp. 1046–1050. [PDF]

  14. K.A.S. Immink. (2011). High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement. In Proceedings of ISIT 2011, St Petersburg, Russia, pp. 278-281.

  15. K.A.S. Immink, J. H. Weber & H. C. Ferreira. (2011). Balanced Runlength Limited Codes Using Knuth's Algorithm. In Proceedings of ISIT 2011, St Petersburg, Russia, pp. 282-285.

  16. L. Jin, C. Xing. (2011). Quantum Gilbert-Varshamov Bound Through Symplectic Self-Orthogonal Codes. In Proceedings of ISIT 2011, St Petersburg, Russia, pp. 455-458.

  17. V. Skachek, K.A.S. Immink. (2011). Constant Weight Codes: An Approach Based on Knuth’s Balancing Method. In Proceedings of ISIT 2011, St Petersburg, Russia, pp. 286 – 290.

  18. Y. M. Chee, H. Wang, L. F. Zhang. (2011). Oblivious transfer and n-variate linear function evaluation. In COCOON 2011 – Proceedings of the 2011 International Computing and Combinatorics Conference, Lecture Notes in Computer Science, vol. 6842, pp. 627 - 637, Springer.

  19. L. Wei, C. Rechberger, J. Guo, H. Wu, H. Wang, S. Ling. (2011). Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster). In Proceedings of the 16th Australasian Conference on Information Security and Privacy (ACISP 2011), Lecture Notes in Computer Science, vol. 6812, pp. 433 - 438, Springer.

  20. Y. Zhang, C. Tartary, H. Wang. (2011). Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem. In Proceedings of the 16th Australasian Conference on Information Security and Privacy (ACISP 2011), Lecture Notes in Computer Science, vol. 6812, pp. 259 - 275,  Springer.

  21. P. H. Nguyen,  H. Wu, H. Wang. (2011). Improving the Time Complexity of the Algorithm 2 of the Multidimensional Linear Cryptanalysis. In Proceedings of the 16th Australasian Conference on Information Security and Privacy (ACISP 2011), Lecture Notes in Computer Science,  vol. 6812, pp. 61 - 74, Springer.

  22. O. Farràs, C. Padró. (2011). Ideal Secret Sharing Schemes for Useful Multipartite Access Structures. In Proceedings of IWCC 2011, Lecture Notes in Computer Science, vol. 6639, pp. 99-108.

  23. A. Moradi, A. Poschmann, S. Ling, C. Paar, H. Wang. (2011). Pushing the Limits: A Very Compact and a Threshold Implementation of AES. In Proceedings of Eurocrypt 2011, Lecture Notes in Computer Science, vol. 6632, pp. 69 - 88, Springer.

  24. J. H. Weber, K.A.S. Immink, H. C. Ferreira. (2011). Extension of Knuth's Balancing Algorithm with Error Correction. In Proceedings of the WIC Symposium, Brussels, Belgium, pp. 286 – 290.

  25. G. Yang, S. Duan, Duncan S. Wong, C. H. Tan, H. Wang. (2011). Authenticated Key Exchange under Bad Randomness. In Proceedings of the Financial Cryptography and Data Security 2011, Lecture Notes in Computer Science, vol. 7035, pp. 113 - 126, Springer.

  26. H. J. Asghar, S. Li, J. Pieprzyk, H. Wang. (2011). Cryptanalysis of the Convex Hull Click Human Identification Protocol. In Proceedings of the 13th Information Security Conference (ISC 2010), Lecture Notes in Computer Science, vol. 6531, pp. 24 - 30, Springer.

  27. F. Oggier, A. Datta. (2011). Self Repairing Homomorphic Codes for Distributed Storage Systems. In Proceedings of INFOCOM 2011.

  28. J. Guo, S. Thomsen. (2011). Deterministic Differential Properties of the Compression Function of BMW. In Proceedings of Selected Areas in Cryptography (SAC 2010), A. Biryukov, G. Gong and D. Stinson ed., LNCS, Springer, Vol. 6544, pp. 338-350.

Book Editorial

  1. Y. M. Chee, Z. Guo, S. Ling, F. Shao, Y. Tang, H. Wang, C. Xing (eds.). (2011). Coding and Cryptology, Proceedings of Third International Workshop, IWCC 2011 (Qingdao, China, May/June 2011), Lecture Notes in Computer Science 6639, Springer, viii + 295 pp.