Cryptography and Cryptanalysis

Security is a critical component to provide information assurance in the emerging pervasive computing paradigm, where people want to access information anytime, anywhere through wireless networked devices. The enormous number of successful attacks attests to the fact that computer security is a complex issue. It requires research in many layers and components in computer systems, and becomes even more challenging when resource-constrained systems like mobile computing devices and sensor nodes are considered. Dr. Kiayias has worked extensively in the design and security analysis of computer systems with particular emphasis on privacy preserving methods of computation, digital rights management, the security of voting equipment and the development of encryption algorithms.

Contributions include the notion of traceable signatures that enable tradeoffs between privacy and identification in credential systems, the discovery of pirate evolution attacks against encryption systems of digital content distribution and the design of patented encryption mechanisms for encrypted media and wireless communication. Dr. Kiayias has developed botnet detection systems funded by the Department of Homeland Security, executed penetration testing and vulnerability analysis for voting equipment funded by the Secretary of the state of CT and has designed and analyzed numerous encryption mechanisms with the support of the National Science Foundation. Dr. Shi has worked in many areas to ensure the security of computer systems, including novel permutation instructions to accelerate block ciphers, efficient implementation of crypto algorithms, side channel attacks and countermeasures, hardware mechanisms for secure and reliable computing, design and improvement of crypto algorithms, and security of sensor networks.

Key Faculty

Aggelos Kiayias (CSE)

Alexander Russell (CSE)

Zhijie Shi (CSE)

Publications

  • Books Edited
    • M. Yung, Y. Dodis, A. Kiayias, T. Malkin, Public Key Cryptography – PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography, New York, NY, USA, April 24-26, 2006, Proceedings. Lecture Notes in Computer Science 3958 Springer 2006, ISBN 3-540-33851-9
  • Book Chapters
    • R. B. Lee, R. L. Rivest, M. Robshaw, Z. Shi, and Y. L. Yin, “Permutation operations in block ciphers,” chapter in Embedded Cryptographic Hardware: Design and Security, Nadia Nedjah and Luiza de Macedo Mourelle, eds., Nova Science Publishers, NY, USA, ISBN 1-59454-145-0, February 2005.
  • Peer-Reviewed Journals
    • A. Kiayias and H.-S. Zhou, “Hidden Identity Based Signatures”, IET Information Security Journal, to appear.
    • H. Yan and Z. Shi, “Software Implementations of Elliptic Curve Cryptography”, International Journal of Network Security, vol. 7, no. 2, September 2008.
    • Z. Shi, X. Yang, and R.B. Lee, “Alternative application-specific processor architecture for fast arbitrary bit permutations,” International Journal of Embedded Systems (IJES), vol. 3, no. 4, pp. 219-228, 2008. http://dx.doi.org/10.1504/IJES.2008.022393
    • A. Kiayias and M. Yung, “Cryptographic Hardness based on the Decoding of Reed Solomon Codes,” IEEE Transactions on Information Theory. Volume 54, No. 6, June 2008, pp. 2752—2769.
    • A. Kiayias and M. Yung, “Cryptanalyzing the Polynomial-Reconstruction based Public-Key System Under Optimal Parameter Choice,” Designs Codes and Cryptography Journal, Springer. Volume 43, Numbers 2-3, June, 2007, pp 61—78.
    • D. Bleichenbacher, A. Kiayias, and M. Yung, “Decoding interleaved Reed Solomon codes over noisy Channels,” Theoretical Computer Science Journal, Elsevier. Volume 379, Number 3, June 2007, pp 348—360
    • A. Kiayias and M. Yung, “Secure scalable group signature with dynamic joins and separable authorities,” International Journal of Security and Networks 2006 – Vol. 1, No.1/2 pp. 24—45.
    • R.B. Lee, X. Yang, and Z. Shi, “Single-cycle bit permutations with MOMR execution,” Journal of Computer Science and Technology, vol. 20, no. 5, pp. 577-585, September 2005.
    • Y. Dodis, N. Fazio, A. Kiayias, and M. Yung, “Scalable Public-Key Tracing and Revoking,” Distributed Computing, Vol. 17, Issue 4, May 2005, pp. 323—347.
    • A. Kiayias and M. Yung, “Directions in Polynomial Reconstruction-Based Cryptography,” IEICE Transactions, Vol. E87-A, No. 5, May 5, 2004. pp. 978—985.
    • R.B. Lee, Z. Shi, and X. Yang, “Efficient permutation instructions for fast software cryptography,” IEEE Micro, vol. 21, no. 6, pp. 56-69, December 2001.
  • Peer-Reviewed Conference Papers
    • G. Argyros and A. Kiayias “I forgot your password: randomness attacks against PHP applications”, in USENIX Security Symposium, 2012.
    • J. Camenisch, A. Kiayias, and M. Yung, “On the Portability of Generalized Schnorr Proofs,” In EUROCRYPT 2009, Cologne, Germany. Lecture Notes in Computer Science, Vol. 5479, pp. 425—442.
    • A. Kiayias and H.-S. Zhou, “Zero-Knowledge proofs with Witness Elimination,” In 12th International Conference on Practice and Theory in Public-Key Cryptography, pp. 124-138, 2009.
    • H. Yan, Z.J. Shi, and Y. Fei, “Efficient implementation of Elliptic Curve Cryptography on DSP for underwater sensor networks,” WkShp on Optimizations for DSP & Embedded Systems (held in conjunction with IEEE/ACM Int. Symp. on Code Generation & Optimization), pp. 7-15, Mar. 2009.
    • F. Zhang and Z. Shi, “An Efficient Window-Based Countermeasure to Power Analysis of ECC Algorithms,” Proceedings of International Conference on Information Technology: New Generations (ITNG 2008), pp. 120-126, April 2008.
    • A. Kiayias and H.-S. Zhou, “Equivocal Blind Signatures and Adaptive UC-Security,” In Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Lecture Notes in Computer Science 4948 Springer 2008, pp. 340-355.
    • A. Kiayias, Y. Tsiounis, and M. Yung, “Group Encryption,” In ASIACRYPT 2007, LNCS 4833, pp. 181–199, 2007. Springer-Verlag Berlin Heidelberg 2007.
    • A. Kiayias and H.-S. Zhou, “Trading Adaptive for Static security in Universally Composable zero-knowledge,” In 34th International Colloquium in Automata, Languages and Programming, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Springer Lecture Notes in Computer Science, pp. 316—327.
    • F. Zhang and Z. Shi, “Power analysis attacks on ECC randomized automata,” Proceedings of ITNG 2007, pp. 900-901, April 2007.
    • A. Kiayias and H.-S. Zhou, “Hidden Identity Based Signatures,” In 11th International Financial Cryptography and Data Security Conference, FC 2007, Scarborough, Trinidad & Tobago, February 11-16, 2007
    • A. Kiayias and H.-S. Zhou, “Concurrent Blind Signatures Without Random Oracles,” In 5th International Conference, SCN 2006, Maiori, Italy, September 6-8, 2006, Springer Lecture Notes in Computer Science 4116, pp. 49-62.
    • F. Zhang and Z. Shi, “New attacks on randomized ECC algorithms,” Proceedings of EITC 2006, August 2006.
    • H. Yan and Z. Shi, “Studying software implementations of Elliptic Curve Cryptography,” Proceedings of ITNG 2006, pp. 78-83, April 2006.
    • A. Kiayias and M. Yung, “Cryptography and decoding Reed-Solomon codes as a hard problem,” Theory and Practice in Information-Theoretic Security, 2005. IEEE Information Theory Workshop, 16-19 Oct. 2005 pp. 48 – 54.
    • A. Kiayias and M. Yung, “Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers,” Progress in Cryptology – Mycrypt 2005, First International Conference on Cryptology in Malaysia, Kuala Lumpur, Malaysia, September 28-30, 2005, Proceedings. Lecture Notes in Computer Science 3715 Springer 2005. pp 151-170.
    • A. Kiayias, Y. Raekow, and A. Russell, “Efficient Steganography with Provable Security Guarantees,” In the proceedings of the 7th Information Hiding Workshop, IH2005, Barcelona Spain, Lecture Notes in Computer Science, Vol. 3727, pp. 118-130. http://www.springerlink.com/content/7j61803440136122/
    • A. Kiayias and M. Yung, “Group Signatures with Efficient Concurrent Join,” in the Proceedings of EUROCRYPT 2005, International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings. Lecture Notes in Computer Science 3494 Springer 2004. pp. 198-214.
    • A. Kiayias and A. Mitrofanova, “Testing Disjointness of Private Datasets,” in the Proceedings of the 9th International Conference on Financial Cryptography and Data Security- FC 2005, Revised Papers, Lecture Notes in Computer Science, Vol. 3570, pp. 109-124. http://www.springerlink.com/content/a149ab5twv9825d7/
    • A. Kiayias and M. Yung, “Cryptanalyzing the Polynomial Reconstruction Based Public-Key Cryptosystem under Optimal Parameter Choice,” in the Proceedings of Advances in Cryptology ASIACRYPT 2004, the 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, Lecture Notes in Computer Science, Vol. 3329, pp. 401-416.
    • Y. Hilewitz, Z. Shi, and R.B. Lee“Comparing fast implementations of bit permutation instructions,” Proceedings of the 38th Annual Asilomar Conference on Signals, Systems, and Computers, pp. 1856-1863, November 2004. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1399486
    • R.B. Lee, X. Yang, and Z. Shi, “Validating Word-oriented Processors for Bit and Multi-Word Operations,” Proceedings of the Asia-Pacific Computer Systems Architecture Conference (ACSAC), pp. 473-488, September 2004.
    • Y. Dodis, A. Nicolosi, A. Kiayias, and V. Shoup, “Anonymous Identification in Ad-Hoc Groups,“ in the Proceedings of EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, May 2-6, 2004, Proceedings. Lecture Notes in Computer Science 3027 Springer 2004. pp. 609-626. http://www.springerlink.com/content/jmqe67dqtjr9tu1a/
    • A. Kiayias, Y. Tsiounis, and M. Yung“Traceable Signatures,“ in the Proceedings of EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings. Lecture Notes in Computer Science 3027 Springer 2004. pp. 571-589.
    • R.B. Lee, R.L. Rivest, M. Robshaw, Z.J. Shi, and Y.L. Yin“On permutation operations in cipher design,” Proceedings of the International Conference on Information Technology (ITCC), vol. 2, pp. 569-577, April 2004.
    • Y. Dodis, N. Fazio, A. Kiayias, and M. Yung, “Scalable Public-Key Tracing and Revoking,” in the Proceedings of the 22nd Symposium on Principles of Distributed Computing (PODC 2003), pp. 190-199, July 2003. http://portal.acm.org/citation.cfm?id=872062
    • A. Kiayias and M. Yung, “Extracting Group Signatures from Traitor Tracing Schemes,” in the Proceedings of EUROCRYPT 2003, Springer, Lecture Notes in Computer Science Vol. 2656, pp. 630-648, May 2003. http://www.springerlink.com/content/btbgl83q27376020/
    • A. Kiayias and M. Yung, “Non-interactive Zero-Sharing with Applications to Private Distributed Decision Making,” in the Proceedings of the Seventh International Financial Cryptography Conference, January 27-30, 2003, Revised Papers. Lecture Notes in Computer Science 2742 Springer 2003, pp. 609-626.
    • A. Kiayias and M. Yung, “Cryptographic Hardness based on the Decoding of Reed-Solomon Codes,” in the Proceedings of the 29th International Colloquium on Automata, Languages and Programming ICALP 2002, Springer, Lecture Notes in Computer Science, Volume 2380, pp. 232-243.
    • A. Kiayias and M. Yung, “Secure Games with Polynomial Expressions,” In the Proceedings of the 28th International Colloquium on Automata, Languages and Programming ICALP 2001, Springer, Lecture Notes in Computer Science Volume 2076, pp. 939-950.
    • A. Kiayias and M. Yung, “Polynomial Reconstruction Based Cryptography (A Short Survey),” in the Proceedings of the Eighth Annual Workshop on Selected Areas in Cryptography, SAC 2001. Springer, Lecture Notes in Computer Science Volume 2249, pp. 129-133.
    • Z. Shi and R.B. Lee, “Bit permutation instructions for accelerating software cryptography,” Proceedings of the IEEE 11th International Conference on Application-Specific Systems, Architectures and Processors (ASAP 2000), pp. 138-148, July 2000.
  • Dissertations
    • Serdar Pehlivanoglou, “Encryption Systems for Digital Content Distribution,” (Advisor: A. Kiayias), 2009 .
    • Hong-Sheng Zhou, “Efficient and Adaptively Secure Cryptographic Primitives —Designing for Composability,” (Advisor: A. Kiayias), 2010 .