Session 1. 09:30 - 10:00 衝突計算困難性を必要としないフォワード安全な逐次型集約可能メッセージ認証 ・廣瀬勝一 (福井大学) (キーワード：メッセージ認証, フォワード安全性, 集約可能性, 衝突計算困難性) 10:00 - 11:00 準同型暗号を用いた秘匿検索 ・安田 雅哉 (富士通研究所) (キーワード：準同型暗号、秘匿検索、プライバシー保護、パターンマッチング計算) 11:00 - 11:15 Coffee Break(15分) Session 2. 11:15 - 11:45 文書依存開示可能なグループ署名 ・花岡 悟一郎 (産業技術総合研究所) (キーワード：プライバシー保護、認証、グループ署名) 11:45 - 12:45 インシデント分析センタNICTERとそのスピンオフ技術 － セキュリティビッグデータへの挑戦 － ・井上 大介 (情報通信研究機構) (キーワード：サイバーセキュリティ，ビッグデータ分析) 12:45 - 13:45 昼休憩(60分) Session 3. 13:45 - 14:15 並列ガウス篩アルゴリズム：128次元イデアル格子の最短ベクトル問題の求解 ・高木 剛 (九州大学) (キーワード：最短ベクトル問題、格子暗号、イデアル格子、ガウス篩、並列計算) 14:15 - 15:15 次世代スーパーコンピュータ技術を用いた超大規模グラフ解析と実社会への応用 ・藤澤 克樹 (中央大学理工学部経営システム工学科) (キーワード：最適化問題, 高性能計算, グラフ解析, スーパーコンピュータ) 15:15 - 15:30 Coffee Break（15分） Session 4. 15:30 - 16:00 効率的なプライバシを考慮した複数ユーザの持つデータ集合の集合演算について ・宮地 充子 (JAIST) (キーワード：プライバシ，集合演算，複数ユーザ) 16:00 - 17:00 潜在空間からのディープナレッジの発見 ・山西 健司 (東京大学 大学院情報理工学系研究科 創造情報学専攻) (キーワード：データマイニング、ビッグデータ、潜在的構造変化検知、潜在変数モデル、動的モデル選択、変化検知) 17:00 - 17:10 Coffee Break (10分); 17:10 - 18:30 議論 (関係者のみ) ※各タイトルをクリックすると講演のアブストラクトが表示されます． ================================================== The 5th Meeting for Cryptology Frontier Group Program (2014/3/5) Session 1. 09:30 - 10:00 Forward-Secure Sequential Aggregate Message Authentication withoutCollision Resistance Shoichi Hirose (University of Fukui) (Keywords: message authentication, forward security, aggregation, collision resistance) The notion of forward-secure sequential aggregate messageauthentication was introduced by Ma and Tsudik in 2007. It is suitable for applications such as audit logging systems and wireless sensor networks. Ma and Tsudik also constructed a scheme with a MAC function and a collision resistant hash function. However, the notion has not been fully formalized and the security of the scheme has not been confirmed. In this talk, forward-secure sequential aggregate message authentication schemes and their security are formalized. Then, a generic construction with a MAC function and a pseudorandom generator is presented. It is also shown that the construction is secure if the underlying primitives are secure. 10:00 - 11:00 Secret search using homomorphic encryption Masaya Yasuda (FUJITSU LABORATORIES Ltd.) (Keywords: Homomorphic encryption, secret search, privacy-preserving, pattern matching computations) Homomorphic encryption is public key encryption supporting additions or/and multiplications on encrypted data (without decryption), and it has been expected to be applied in various areas mainly including privacy-preserving data mining (PPDM) since C. Gentry in 2009 proposed a concrete construction of a fully homomorphic encryption scheme. In this talk, we present a method to efficiently compute pattern matching computations on encrypted data, which can be used for string search, and then we give a demonstration of secret search for DNA information as a concrete application of our method. 11:00 - 11:15 Coffee Break (15 min) Session 2. 11:15 - 11:45 Group Signatures with Message-Dependent Opening Goichiro Hanaoka (AIST) (Keywords: Privacy protection, Identification, Group signature) It is expected that the big data will be actively used for enhancing various information services. However, in such services, it is also important to protect users' privacy, and the group signature is considered as a useful cryptographic tool for dealing with it. In this talk, we introduce group signatures with message-dependent opening property which enables to relax the required level of trust for the opener. 11:45 - 12:45 NICTER and Its Spin-off Technologies - Challenge for Security Big Data - Daisuke Inoue (NICT) (Keywords:Cybersecurity, Darknet, Malware, APT, Security Big Data) Cybersecurity needs the ability to effectively analyze the security big data such a bunch of network traffic and a lot of malware samples, etc. In this talk, we present the overview of incident analysis system “NICTER”, darknet-based alert system “DAEDALUS” and APT countering system "NIRVANA-Kai”. In addition, we present our big data analysis technologies behind these systems. 12:45 - 13:45 Lunch Time (60 min) Session 3. 13:45 - 14:15 Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice Tuyoshi Takagi (Kyushu University) (Keywords: shortest vector problem, lattice-based cryptography, ideal lattice, Gauss Sieve algorithm, parallel algorithm) Lattice-based cryptography allows us to compute logic operations in the encrypted data, and it provides us many privacy-preserving cryptographic protocols. The security of lattice-based cryptography is based on the hardness of solving the shortest vector problem (SVP) in lattices. In this talk, we give a short survey of the security analysis of lattice-based cryptography including recent records of solving SVP via large-scaled experiments. In particular, we deal with the parallelization of the Gauss Sieve algorithm proposed by Micciancio and Voulgar in 2001. We propose a practical parallelized Gauss Sieve algorithm for large dimensions with a small communication overhead. We succeeded in solving the SVP Challenge from TU Darmstadt over a 128-dimensional ideal lattice generated by the cyclotomic polynomial x^128+1 using about 30,000 CPU hours. 14:15 - 15:15 Extremely large-scale graph analysis and its applications using new techniques for next generation super computer Katsuki FUJISAWA (Chuo University) (Keywords: Mathematical Optimization, High-performance computing, Graph analysis, Super computer) The objective of many ongoing research projects in high performance computing (HPC) areas, such as Graph500 and Green Graph500 benchmarks, is to develop an advanced computing and optimization infrastructure for extremely large-scale graphs on the peta-scale supercomputers. The extremely large-scale graphs that have recently emerged in various application fields, such as transportation, social networks, cyber-security, and bioinformatics, require fast and scalable analysis. The number of vertices in the graph networks has grown from billions to trillions and that of the edges from hundreds of billions to tens of trillions, and therefore, we propose a new framework of software stacks for extremely large-scale graph analysis systems, such as parallel graph analysis and optimization libraries on multiple CPUs and GPUs, hierarchal graph stores using non-volatile memory (NVM) devices, and graph processing and visualization systems. 15:15 - 15:30 Coffee Break（15 min） Session 4. 15:30 - 16:00 Efficient Privacy-Preserving Set Operations for Multiple Users Atsuko Miyaji (JAIST) (Keywords: Privacy，Set Operations, Multiple Users) Recently, electronic information which includes sensitive data is stored in various parties. In many scenarios, those information stored in different parties need to be shared without complete mutual trust. Privacy set operations are useful to compute various set operations such as set intersection, set union, element reduction, or those cardinality with privacy. That is, no party learn more information about other parties sets than what can be deduced from the result. In this research, we report privacy-preserving set operations for multiple users. 16:00 - 17:00 Deep Knowledge Discovery from Latent Space Kenji Yamanishi (The University of Tokyo) (Keywords: Data mining, big data, latent dynamics, latent variable model, dynamic model selection, change detection) In big data analysis, the main difficulty may come from the complexity of data (high-dimensionality, non-stationarity, heterozygosis) rather than its volume. In this talk I introduce some novel technologies to discover deep knowledge from such complex data. Specifically we are concerned with the issue of discovering latent dynamics. The key ideas of the technology are to employ probabilistic models with latent variables (of network types) and to detect changes of their structures. I introduce a number of mathematical tools for such analysis, including tracking best experts, dynamic model selection, and switching distributions. I also show examples of their applications into the real domains, e.g. marketing, ad impact relation analysis, event detection, educational data mining. 17:00 - 17:10 Coffee Break (10 min) 17:10 - 18:30 Discussion