Publications

Please also refer to my Google Scholar page and my DBLP page for further publication lists.

  1. N. Attrapadung, G. Hanaoka, T. Matsuda, H. Morita, K. Ohara, J. Schuldt, T. Teruya, K. Tozawa. Oblivious Linear Group Actions and Applications. In ACM-CCS 2021, to appear, 2021.

  2. N. Attrapadung, J. Tomida. Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions. In Advances in Cryptology — ASIACRYPT 2020 (3), pp. 405-436, 2020.

  3. K. Phalakarn, V. Suppakitpaisarn, N. Attrapadung, K. Matsuura. Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials. In INDOCRYPT 2020, pp. 763-785, 2020.

  4. N. Nishida, T. Oba, Y. Unagami, J. P. Cruz, N. Yanai, T. Teruya, N. Attrapadung, T. Matsuda, G. Hanaoka. Efficient Secure Neural Network Prediction Protocol Reducing Accuracy Degradation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12), pp. 1367-1380, 2020.

  5. H. Morita, N. Attrapadung, T. Teruya, S. Ohata, K. Nuida, G. Hanaoka. Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1), pp. 21-32, 2020.

  6. N. Attrapadung. Unbounded Dynamic Predicate Compositions in Attribute-Based Encryption. In Advances in Cryptology — EUROCRYPT 2019 (1), pp. 34–67, 2019.

  7. R. Kikuchi, N. Attrapadung, K. Hamada, D. Ikarashi, A. Ishida, T. Matsuda, Y. Sakai, J. C. N. Schuldt. Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation. In ACISP 2019, pp. 343–361, 2019.

  8. H. Morita, N. Attrapadung. Client-Aided Two-Party Secure Interval Test Protocol. In CANS 2019, pp. 328–343, 2019.

  9. N. Attrapadung, T. Matsuda, R. Nishimaki, S. Yamada, T. Yamakawa. Adaptive Single-key Secure Constrained PRFs for NC1. In Public Key Cryptography — PKC 2019, pp. 223–253, 2019.

  10. N. Attrapadung, G. Hanaoka, S. Kiyomoto, T. Mimoto, J. C. N. Schuldt. A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9), pp. 1048-1060, 2019.

  11. Y. Sakai, S. Katsumata, N. Attrapadung, G. Hanaoka. Attribute-Based Signatures for Unbounded Languages from Standard Assumptions. In Advances in Cryptology — ASIACRYPT 2018 (2), pp. 493–522, 2018.12

  12. N. Attrapadung, G. Hanaoka, T. Hirano, Y. Kawai, Y. Koseki, J. C. N. Schuldt. Token-Based Multi-input Functional Encryption. In Provable Security – ProvSec 2018, pp. 147–164, 2018.10

  13. H. Morita, N. Attrapadung, T. Teruya, S. Ohata, K. Nuida, G. Hanaoka. Constant- Round Client-Aided Secure Comparison Protocol. In European Symposium on Research in Computer Security — ESORICS 2018 (2), pp. 395–415, 2018.09

  14. N. Attrapadung, T. Matsuda, R. Nishimaki, S. Yamada, T. Yamakawa. Constrained PRFs for NC1 in Traditional Groups. In Advances in Cryptology — CRYPTO 2018 (2), Lecture Notes in Computer Science, pp. 543–574, 2018.08

  15. N. Attrapadung, G. Hanaoka, S. Mitsunari, Y. Sakai, K. Shimizu, T. Teruya. Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Imple- mentation in WebAssembly. In Asia Conference on Computer and Communications Security — AsiaCCS 2018, pp. 685–697, 2018.05

  16. N. Attrapadung, G. Hanaoka, K. Ogawa, G. Ohtake, H. Watanabe, S. Yamada. Attribute-Based Encryption for Range Attributes. In IEICE Transactions 101-A(9), pp. 1440–1455, 2018

  17. K. Yamada, N. Attrapadung, K. Emura, G. Hanaoka, K. Tanaka. Generic Construc- tions for Fully Secure Revocable Attribute-Based Encryption. In IEICE Transactions101-A(9) pp. 1456–1472, 2018

  18. Y. Sakai, N. Attrapadung, G. Hanaoka. Practical attribute-based signature schemes for circuits from bilinear map. In IET Information Security 12(3), pp. 184–193, 2018

  19. K. Yamada, N. Attrapadung, K. Emura, G. Hanaoka, K. Tanaka. Generic Construc- tions for Fully Secure Revocable Attribute-Based Encryption. In European Symposium on Research in Computer Security — ESORICS 2017 (2), pp. 532–551, 2017.09

  20. N. Attrapadung, G. Hanaoka, S. Kiyomoto, T. Mimoto, J. C. N. Schuldt. A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions. In Privacy, Security and Trust — PST 2017, pp. 215–224, 2017.08

  21. N. Attrapadung. Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits. In Public Key Cryptography — PKC 2017 (2), Lecture Notes in Computer Science, pp. 3–35, 2017.03

  22. N. Attrapadung, G. Hanaoka, S. Yamada. New Security Proof for the Boneh-Boyen IBE: Tight Reduction in Unbounded Multi-Challenge Security. In IEICE Transactions100-A(9). pp. 1882–1890, 2017

  23. Y. Unagami, N. Matsuzaki, S. Yamada, N. Attrapadung, T. Matsuda, G. Hanaoka. Pri- vate Similarity Searchable Encryption for Euclidean Distance. In IEICE Transactions 100-D(10), pp. 2319–2326, 2017

  24. N. Attrapadung. Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings. In Advances in Cryptology — ASIACRYPT 2016 (2), Lecture Notes in Computer Science, pp. 591–623, 2016.12.

  25. N. Attrapadung, G. Hanaoka, K. Ogawa, G. Ohtake, H. Watanabe, S. Yamada. Attribute Based Encryption for Range Attributes. In Security and Cryptography for Networks — SCN 2016, Lecture Notes in Computer Science, 2016.08.

  26. N. Attrapadung, G. Hanaoka, T. Matsumoto, T. Teruya, S. Yamada. Attribute Based Encryption with Direct Efficiency Tradeoff. In Applied Cryptography and Network Security — ACNS 2016, Vol. 9696 of Lecture Notes in Computer Science, pp. 249–266, 2016.05.

  27. Y. Sakai, N. Attrapadung, G. Hanaoka. Attribute-Based Signatures for Circuits from Bilinear Map. In Public Key Cryptography — PKC 2016 (1), pp. 283–300, Vol. 9614 of Lecture Notes in Computer Science, 2016.03.

  28. N. Attrapadung, G. Hanaoka, S. Yamada. Conversions among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs. In Advances in Cryptology — ASIACRYPT 2015 (1), Vol. 9452 of Lecture Notes in Computer Science, pp. 575–601, 2015.12.

  29. N. Attrapadung, G. Hanaoka, S. Yamada. A Framework for Identity-Based Encryption with Almost Tight Security. In Advances in Cryptology — ASIACRYPT 2015 (1), Vol. 9452 of Lecture Notes in Computer Science, pp. 521–549, 2015.12.

  30. N. Attrapadung, K. Emura, G. Hanaoka, Y. Sakai. Revocable Group Signature with Constant-Size Revocation List. In The Computer Journal 58 (10): pp. 2698–2715 (2015).

  31. N. Attrapadung, S. Yamada. Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings. In Topics in Cryptology — CT-RSA 2015, Vol. 9048 of Lecture Notes in Computer Science, pp. 87–105, 2015.04.

  32. N. Attrapadung, G. Hanaoka, S. Yamada. New Security Proof for the Boneh-Boyen IBE: Tight Reduction in Unbounded Multi-challenge Security. In The International Conference on Information, Communications and Signal Processing — ICICS 2014, Vol. 8958 of Lecture Notes in Computer Science, pp. 176–590, 2015.12.

  33. N. Attrapadung, K. Emura, G. Hanaoka, Y. Sakai. A Revocable Group Signature Scheme From Identity-Based Revocation Techniques: Achieving Constant-size Revoca- tion List. In Applied Cryptography and Network Security — ACNS 2014, Vol. 8479 of Lecture Notes in Computer Science, pp.419–437, 2014.06.

  34. N. Attrapadung. Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More. In Advances in Cryptology — EUROCRYPT 2014, Vol. 8441 of Lecture Notes in Computer Science, pp. 557–577, Springer, 2014.05.

  35. S. Yamada, N. Attrapadung, G. Hanaoka, N. Kunihiro. A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption. In Public Key Cryptog- raphy — PKC 2014, Vol. 8383 of Lecture Notes in Computer Science, pp. 275-292, Springer, 2014.03.

  36. T. Kitagawa, H. Kojima, N. Attrapadung, H. Imai. Efficient and Fully Forward-Secure Ciphertext-Policy Attribute-Based Encryption. In Information Security Conference — ISC 2013, Vol. 7807 of Lecture Notes in Computer Science, pp. 87–99, Springer, 2013.11.

  37. N. Attrapadung, B. Libert, T. Peters. Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures. In Public Key Cryptography — PKC 2013, Vol. 7778 of Lecture Notes in Computer Science, pp. 386-404, Springer, 2013.03.

  38. N. Attrapadung, B. Libert, T. Peters. Computing on Authenticated Data: New Privacy Definitions and Constructions. In Advances in Cryptology — ASIACRYPT 2012, Vol. 7658 of Lecture Notes in Computer Science, pp. 367-385, Springer, 2012.12.

  39. K. Kasamatsu, T. Matsuda, K. Emura, N. Attrapadung, G. Hanaoka, H. Imai. Time- Specific Encryption form Forward Secure-Encryption. In Security and Cryptography for Networks — SCN 2012, Vol. 7485 of Lecture Notes in Computer Science, pp. 184-204, Springer, 2012.9.

  40. S. Yamada, N. Attrapadung, B. Santoso, J. C. N. Schuldt, G. Hanaoka, N. Kunihiro. Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication. In Public Key Cryptography — PKC 2012, Vol. 7293 of Lecture Notes in Computer Science, pp. 243-261, Springer, 2012.05.

  41. N. Attrapadung, J. Herranz, F. Laguillaumie, B. Libert, E. Panafieu, C. Ràfols. Attribute-Based Encryption Schemes with Constant-Size Ciphertexts. In Theoretical Computer Science, Vol. 422, pp. 15-38, Elsevier, 2012.03.

  42. N. Attrapadung, B. Libert. Functional Encryption for Public-Attribute Inner Product. In Journal of Mathematical Cryptology, Vol. 5, No. 2, pp. 115-158, 2011.10.

  43. A. Fujii, G. Ohtake, G. Hanaoka, N. Attrapadung, H. Watanabe, K. Ogawa, H. Imai. Secure Broadcast System with Simultaneous Individual Messaging. In IEICE Transactions on Fundamental of Electronics, Communications and Computer Sciences, Special Issue on Discrete Mathematics and Its Applications Vol. 94-A(6): 1328-1337 (2011).

  44. N. Attrapadung, B. Libert. Homomorphic Network Coding Signatures in the Standard Model. In Public Key Cryptography — PKC 2011, volume 6571 of LNCS, pages 17-34, Springer-Verlag, 2011.03.

  45. N. Attrapadung, B. Libert, E. Panafieu. Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts. In Public Key Cryptography — PKC 2011, volume 6571 of LNCS, pages 90-108, Springer-Verlag, 2011.03.

  46. N. Attrapadung, G. Hanaoka, N. Kunihiro, S. Yamada. Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption. In Public Key Cryptography — PKC 2011, volume 6571 of LNCS, pages 71-89, Springer-Verlag, 2011.03.

  47. N. Attrapadung, H. mai. Dual-Policy Attribute Based Encryption: Simultaneous Access Control with Ciphertext and Key Policies. In IEICE Transactions on Funda- mental of Electronics, Communications and Computer Sciences — Special Section on Information and Communication System Security Vol.E93-A No.1 pp.116-125, 2010.01.

  48. N. Attrapadung, B. Libert. Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation. In Public Key Cryptography — PKC 2010, volume 6056 of LNCS, pages 384-402, Springer-Verlag, 2010.05.

  49. N. Attrapadung, H. Imai. Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes. In IMA Cryptography and Coding Conference 2009, volume 5921 of LNCS, pages 278-300, Springer-Verlag, 2009.12.

  50. N. Attrapadung, H. Imai. Conjunctive Broadcast and Attribute-Based Encryption. In Pairing-Based Cryptography — Pairing 2009, volume 5671 of LNCS, pages 248-265, Springer-Verlag, 2009.08.

  51. N. Attrapadung, H. Imai. Dual-Policy Attribute Based Encryption. In Applied Cryptography and Network Security — ACNS 2009, volume 5536 of LNCS, pages 168-185, Springer-Verlag, 2009.05.

  52. J. Furukawa, N. Attrapadung, R. Sakai, G. Hanaoka. A Fuzzy ID-Based Encryption Efficient When Error Rate Is Low. In INDOCRYPT 2008, Lecture Note in Computer Science, volume 5365 of LNCS, pages 116-129, Springer-Verlag, 2008.11.

  53. T. Matsuda, N. Attrapadung, G. Hanaoka, K. Matsuura, H. Imai. A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions. In IEICE Transactions on Fundamental of Electronics, Communications and Computer Sciences, Special Section on Information and Communication System Security, Vol. 91-D, No.5, pp.1466-1476, 2008.05.

  54. N. Attrapadung, J. Furukawa, T. Gomi, G. Hanaoka, H. Imai, R. Zhang, Efficient Identity-Based Encryption with Tight Security Reduction, In IEICE Transaction on Fundamental, Special Section on Cryptography and Information Security, Vol. 90-A, No. 9, pp.1803-1813, 2007.09.

  55. T. Matsuda, N. Attrapadung, G. Hanaoka, K. Matsuura, H. Imai, A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function, In ProvSec 2007, volume 4784 of LNCS, pages 68-84. Springer-Verlag, 2007.

  56. N. Attrapadung, J. Furukawa. Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys. In International Colloquium on Automata, Languages and Programming — ICALP 2007, volume of LNCS, Springer- Verlag, 2007.

  57. N. Attrapadung, H. Imai. Practical Broadcast Encryption from Graph-Theoretic Techniques and Subset-Incremental-Chain Structure. In IEICE Transaction on Fun- damental of Electronics, Communications and Computer Sciences — Special Section on Cryptography and Information Security, Vol.E90-A No.1 pp.187-203, Jan. 2007.

  58. N. Attrapadung, J. Furukawa, T. Gomi, G. Hanaoka, H. Imai, R. Zhang. Efficient Identity-Based Encryption with Tight Security Reduction. In Cryptology and Network Security — CANS 2006, volume 4301 of LNCS, pages 19-36. Springer-Verlag, 2006.

  59. N. Attrapadung, J. Furukawa, and H. Imai. Forward-secure and searchable broadcast encryption with short ciphertexts and private keys. In ASIACRYPT 2006, volume 4284 of LNCS, pages 161-177. Springer-Verlag, 2006.

  60. N. Attrapadung, Y. Cui, D. Galindo, G. Hanaoka, I. Hasuo, H. Imai, K. Matsuura, P. Yang, R. Zhang. Relations Among Notions of Security for Identity Based Encryption Schemes. In Latin American Theoretical Informatics — LATIN 2006, volume 3887 of LNCS, pages 130-141, Springer-Verlag, March 2006.

  61. N. Attrapadung and H. Imai. Graph-decomposition-based frameworks for subset-cover broadcast encryption and efficient instantiations. In ASIACRYPT 2005, volume 3788 of LNCS, pages 100-120. Springer-Verlag, 2005.

  62. N. Attrapadung, K. Kobara, and H. Imai. Sequential key derivation patterns for broadcast encryption and key predistribution schemes. In ASIACRYPT 2003, volume 2894 of LNCS, pages 374-391. Springer-Verlag, 2003.


Books

  • N. Attrapadung, T. Yagi. Advances in Information and Computer Security - 14th International Workshop on Security, IWSEC 2019, Tokyo, Japan, August 28-30, 2019, Proceedings. Lecture Notes in Computer Science 11689, Springer 2019, ISBN 978-3-030-26833-6

Awards

  • Tsujii Shigeo Security Paper Award 2021.

  • ACISP 2019 Best Paper Award.

  • IEICE Best Paper Award 2018.

  • MEXT Young Scientist Award (for the year 2017), Ministry of Education, Culture, Sports, Science and Technology (MEXT), Tokyo, Japan (April 19, 2017).

  • AIST President Award (for the year 2015), AIST, Tsukuba, Japan (April 1, 2016).

  • Best Demonstration Award at CSS 2014, Computer Security Symposium 2014, Sapporo, Japan (October 23, 2014).

  • Best Poster Award at IWSEC 2013, International Workshop on Security (IWSEC) 2013, Okinawa, Japan (November 19, 2013).

  • Ericsson Young Scientist Award of the Year 2010, Ericsson Corp., Tokyo, Japan (November 12, 2010). Award for contributions in the field of telecommunication research.

  • Dean’s Award for Ph.D. Thesis, Graduate school of Information Science and Technology, University of Tokyo, 2007.

  • Best Paper Award at SCIS 2006, The 22nd Symposium on Cryptography and Information Security, Hiroshima, Japan, 2006.

  • Best Paper Award at SITA 2005, The 28th Symposium on Information Theory and Its Application, Okinawa, Japan, 2005.

  • Dean’s Award for Master Thesis, Graduate school of Information Science and Technology, University of Tokyo, 2004.