Journal Papers

1. K. A. S. Immink. (2012). High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement. IEEE Transactions on Information Theory, vol. 58, no. 10, pp. 6572 - 6580.
   


2. J. Cilleruelo, I. E. Shparlinski, A. Zumalacarregui. (2012). Isomorphism classes of elliptic curves over a finite field in some thin families. Mathematical Research Letters, vol. 19, pp. 335 - 343.
   


3. R. R. Farashahi, P. A. Fouque, I. E. Shparlinski, M. Tibouchi, F. Voloch. (2012). Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Mathematics of Computation, vol. 82, pp. 491 - 512.
   


4. L. Jin, C. Xing. (2012). Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes. IEEE Transactions on Information Theory, vol. 58, no. 8, pp. 5484 - 5489.
   


5. Y. M. Chee, X. Zhang. (2012). Improved constructions of frameproof codes. IEEE Transactions on Information Theory, vol. 58, no. 8, pp. 5449 - 5453. [PDF]
   


6. I. Cascudo, R. Cramer, C. Xing, A. Yang. (2012). Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. IEEE Transactions on Information Theory, vol. 58, no. 7, pp. 4930 - 4935.
   


7. S. H. Dau, V. Skachek, Y. M. Chee. (2012). On the security of index coding with side information. IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3975 – 3988. [PDF]
   


8. H. W. Lim, F. Kerschbaum, H. Wang. (2012). Workflow signatures for business process compliance. IEEE Transactions on Dependable and Secure Computing (TDSC), vol. 9, no. 5, pp. 756-769.
   


9. O. Farràs, I. Gracia, S. Martin, C. Padro. (2012). Linear threshold multisecret sharing schemes. Information Processing Letters, vol. 112, pp. 667 – 673.
   


10. O. Farràs, C. Padró. (2012). Ideal Hierarchical Secret Sharing Schemes. IEEE Transactions on Information Theory, vol. 58, no. 5, pp. 3273 - 3286.
    


11. Y. Desmedt, J. Pieprzyk, R. Steinfeld, X. Sun, C. Tartary, H. Wang, Andrew C.-C. Yao. (2012). Graph Coloring Applied to Secure Computation in Non-Abelian Groups. Journal of Cryptology, vol. 25, no. 4, pp. 557 - 600.
    


12. A. Beimel, Y. M. Chee, H. Wang, L. F. Zhang. (2012). Communication-efficient distributed oblivious transfer. Journal of Computer and System Sciences, vol. 78, no. 4, pp. 1142–1157. [PDF]
    


13. S. Ling, E. Ozdemir, C. Xing. (2012). Constructing Irreducible Polynomials over Finite Fields. Mathematics of Computation, vol. 81, no. 279, pp. 1663-1668.
    


14. S. Ling, I. E. Shparlinski, R. Steinfeld, H. Wang. (2012). On the Modular Inversion Hidden Number Problem. Journal of Symbolic Computation, vol. 47, no. 4, pp. 358 - 367.
    


15. R. Vehkalahti, C. Hollanti, F. Oggier. (2012). Fast-Decodable Asymmetric Space-Time Codes from Division Algebras. IEEE Transactions on Information Theory, vol. 58, no. 4, pp. 2362-2385.
    


16. O. Farràs, J. Martí-Farré, C. Padró. (2012). Ideal Multipartite Secret Sharing Schemes. Journal of Cryptology, vol. 25, no. 3, pp. 434 - 463.
    


17. Y. Ding, L. Jin, C. Xing. (2012). Good Linear Codes From Polynomial Evaluations. IEEE Transactions on Communications, vol. 60, no. 2, pp. 357 – 363.
    


18. O. Farràs, J. R. Metcalf-Burton, C. Padró, L. Vázquez. (2012). On the Optimization of Bipartite Secret Sharing Schemes. Designs, Codes and Cryptography, vol. 63, no. 2, pp. 255 - 271.
    


19. F. Oggier, P. Sole, J.-C. Belfiore. (2012). Codes over Matrix Rings for Space-Time Coded Modulations. IEEE Transactions on Information Theory, vol. 58, no. 2, pp. 734-746
    


20. A. Ostafe, I. E. Shparlinski. (2012). Multiplicative character sums and products of sparse integers in residue classes. Periodica Mathematica Hungarica, vol. 64, no. 2, pp. 247 – 255.
    


21. S. Ling, L. Qu. (2012). A note on linearized polynomials and the dimension of their kernels. Finite Fields and their Applications, vol. 18, no. 1, pp. 56 – 62.
    


22. H. M. Kiah, K. H. Leung, S. Ling. (2012). A note on cyclic codes over GR(p^2, m) of length p^k. Designs, Codes and Cryptography, vol. 63, issue 1, pp. 105-112.
    


23. Y. M. Chee, H. Wang, L. F. Zhang. (2012). On the Bringer-Chabanne EPIR protocol for polynomial evaluation. Journal of Mathematical Cryptology, vol. 5, no. 3–4, pp. 277–301. [PDF]
    


24. Z. Zhang, Y. M. Chee, S. Ling, M. Liu, H. Wang. (2012). Threshold changeable secret sharing schemes revisited. Theoretical Computer Science, vol. 418, pp. 106–115. [PDF]
    


25. Y. M. Chee, L. Ji, A. Lim, A. K. H. Tung. (2012). Arboricity: an acyclic hypergraph decomposition problem motivated by database theory. Discrete Applied Mathematics, vol. 160, no. 1–2, pp. 100–107. [PDF]
    


26. Y. M. Chee, S. Ling, Y. Tan, X. Zhang. (2012). Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences. Mathematics of Computation, vol. 81, no. 277, pp. 585–603. [PDF]
    
    
27. S. Jitman, S. Ling, P. Udomkavanich. (2012). Skew constacyclic codes over finite chain rings. Advances in Mathematics of Communications, vol. 6, no. 1, pp. 39–63.
    
    

Conference Papers

1. H. Wu, T. Huang, P. H. Nguyen, H. Wang, S. Ling. (2012). Differential Attacks Against Stream Cipher ZUC. In Proceedings of the 18th International Conference on the Theory and Application of Cryptology and Information (Asiacrypt 2012), LNCS, vol. 7658, pp. 262 - 277, Springer.
   


2. C-N. Chen, N. Jacob, S. Kutzner, S. Ling, A. Poschmann, S. Saetang. (2012). Standardized Signature Algorithms on Ultra-Constrained 4-Bit MCU. In Proceedings of the 7th International Workshop on Security (IWSEC 2012), LNCS, vol. 7631, pp. 37 - 50, Springer.
   


3. N. Markin, F. Oggier. (2012). Fast Decodable Codes for 6Tx-3Rx MIMO Systems. In Proceedings of the International Conference on Signal Processing and Communications (SPCOM 2012), pp. 1 – 5.
   


4. J. Choy, H. Yap, K. Khoo, J. Guo, T. Peyrin, A. Poschmann, C. H. Tan. (2012). SPN-Hash: Improving the Provable Resistance Against Differential Collision Attacks. In Proceedings of the 5th International Conference on Cryptology (Africacrypt 2012), LNCS, vol. 7374, pp. 270-286, Springer.
   


5. J. Chen, H. W. Lim, S. Ling, H. Wang, T.T.K. Nguyen. (2012). Revocable identity-based encryption from lattices. In Proceedings of the 17th Australasian Conference on Information Security and Privacy (ACISP 2012), pp. 390-403.
   


6. Y. M. Chee, H. M. Kiah, C. Wang. (2012). Maximum distance separable symbol-pair codes. In ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 2896–2900. [PDF]
   


7. S. H. Dau, V. Skachek, Y. M. Chee. (2012). Optimal index codes with near-extreme rates. In ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 2251–2255. [PDF]
   


8. Y. M. Chee, H. M. Kiah, A. C. H. Ling, C. Wang. (2012). Optimal equitable symbol weight codes for power line communications. In ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 671–675. [PDF]
   


9. Y. M. Chee, H. M. Kiah, P. Purkayastha, C. Wang. (2012). Importance of symbol equity in coded modulation for power line communications. In ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 666–670. Student Paper Award finalist. [PDF]
   


10. Y. M. Chee, P. Purkayastha. (2012). Efficient decoding of permutation codes obtained from distance preserving maps. In ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 641–645. [PDF]
    


11. C. Bracken, Y. M. Chee, P. Purkayastha. (2012). Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices. In ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 116–119. [PDF]
    


12. C. Hollanti, N. Markin. (2012). Algebraic Fast-Decodable Relay Codes for Distributed Communications. In Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT 2012), pp. 940 – 944.
    


13. L. Jin, C. Xing. (2012). A Construction of Quantum Codes via A Class of Classical Polynomial Codes. In Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT 2012), pp. 344-347.
    


14. N. Markin, F. Oggier. (2012). A Class of Iterated Fast Decodable Space-Time Codes for 2n Tx Antennas. In Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT 2012), pp. 2836 – 2840.
    


15. R. Steinfeld, S. Ling, J. Pieprzyk, C. Tartary, H. Wang. (2012). NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model. In Proceedings of the 15th International Conference on Practice and Theory in Public-Key Cryptography (PKC 2012), LNCS, vol. 7293, pp. 353-371, Springer.
    


16. V. Guruswami, C. Xing. (2012). Folded codes from function fields and improved list decoding. In Proceedings of the 44th ACM Symposium on Theory of Computing (STOC 2012), pp. 339 – 350.
    


17. J. Chen, H. Wee, H. W. Lim, S. Ling, H. Wang. (2012). Compact IBE and signatures via asymmetric pairings. In Proceedings of the 5th International Conference on Pairing-Based Cryptography (Pairing 2012), LNCS, vol. 7708, pp. 122-140, Springer.
    


18. L. Wei, T. Peyrin, P. Sokolowski, S. Ling, J. Pieprzyk, H. Wang. (2012). On the (In)Security of IDEA in Various Hashing Modes. In Proceedings of the 19th International Workshop on Fast Software Encryption (FSE 2012), pp. 163 – 179.