情報基礎理論研究グループComputing Theory Research Group

情報基礎理論研究グループ

計算機やネットワーク上で情報を巧みに操るための基礎理論を構築しています。インターネット上の暗号通信プロトコルは本当に安全か? 量子コンピュータ上でうまく動くソフトウェアはどのようなものか?などを、情報科学、計算機科学的手法を用いて追求します。これによって、安全で快適な情報流通サービスの実現を目指します。

グループリーダ 谷 誠一郎

研究紹介

発表文献

  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012

2019

論文

  1. Takeuchi, Y., Matsuzaki, Y., Miyanishi, K., Sugiyama, T., Munro, W. J.: Quantum remote sensing with asymmetric information gain. Physical Review A, vol. 99, 022325 (2019).
  2. Akibue, S., Kato, G., N. Marumo: Perfect discrimination of nonorthogonal quantum states with posterior classical partial information. Physical Review A (Rapid Communication & Editor’s suggestion), vol. 99, 020102(2019)

国際会議

  1. Akibue, S., Kato, G., Marumo N.: Perfect discrimination of nonorthogonal quantum states with posterior classical partial information. The 22nd Annual Conference on the Quantum Information Processing(QIP 2019)(2019)
  2. Baeum, S., Azuma, K., Kato, G., Elkouss, D.: Linear programs for entanglement and key distribution in the quantum internet. The 22nd Annual Conference on the Quantum Information Processing(QIP 2019)(2019)
  3. Takahashi, Y. and Tani, S.: Power of uninitialized qubits in shallow quantum circuits. The 22nd Annual Conference on the Quantum Information Processing(QIP 2019)(2019)
  4. Takeuchi, Y., Mantri, A., Morimae, T., Mizutani, A., Fitzsimons, J.: Resource-efficient verification of quantum computing using Serfling's bound. The 22nd Annual Conference on the Quantum Information Processing(QIP 2019)(2019)

2018

論文

  1. Fujii, K., Kobayashi, H., Morimae, T., Nishimura, H., Tamate, S., Tani, S.: Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error. Physical Review Letters, vol. 120, 200502 (2018).
  2. Akibue, S., Kato, G.: Bipartite discrimination of independently prepared quantum states as a counterexample of a parallel repetition conjecture. Physical Review A, vol. 97, 042309, (2018).
  3. Morimae, T., Takeuchi, Y., Nishimura, H.: Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy. Quantum, vol. 2, 106 (2018).
  4. Mizutani, A. Sasaki, T., Kato, G., Takeuchi, Y., Tamaki, K.: Information-theoretic security proof of differential-phase-shift quantum key distribution protocol based on complementarity Quantum Science and Technology, vol. 3,014003(2018)
  5. Tamaki, K., Lo H. K., Mizutani, A., Kato, G., Wen, C. L. C., Azuma, K., Curty. M.,: Security of quantum key distribution with iterative sifting Quantum Science and Technology, vol.3,014002(2018)
  6. Owari, M. Kato, G., Hayashi M.: Single-shot secure quantum network coding on butterfly network with free public communication Quantum Science and Technology, vol.3,014001(2018)
  7. Rigovacca, L., Kato, G., Baeuml, S., Kim, M. S., Munro, W. J., Azuma, K.: Versatile relative entropy bounds for quantum networks. New Journal of Physics, vol. 20, 013033 (2018)

国際会議

  1. Le Gall, F., Morimae, T., Nishimura, H., Takeuchi, Y.: Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. Proc. of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), pp.26:1-26:13 (2018).
  2. Takahashi, Y. and Tani, S.: Power of uninitialized qubits in shallow quantum circuits, Proc. of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), LIPIcs 96, pp. 57:1-57:13 (2018).
  3. Akibue, S., Kato, G., Marumo N.: Perfect discrimination of nonorthogonal quantum states with posterior classical partial information. The 1st International Conference on the Quantum Computing(ICoQC 2018)(2018)
  4. Baeum, S., Azuma, K., Kato, G., Elkouss, D.: Linear programs for entanglement and key distribution in the quantum Internet. 18th Asian Quantum Information Science Conference (AQIS 2018) (2018).
  5. Le Gall, F., Morimae, T., Nishimura, H., Takeuchi, Y.: Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. 18th Asian Quantum Information Science Conference (AQIS 2018) (2018).
  6. Takahashi, Y. and Tani, S.: Power of uninitialized qubits in shallow quantum circuits, 18th Asian Quantum Information Science Conference (AQIS 2018) (2018).
  7. Takeuchi, Y., Morimae, T.: Verification of many-qubit states. 18th Asian Quantum Information Science Conference (AQIS 2018) (2018).
  8. Takeuchi, Y.: Resource-efficient verification of quantum computing using Serfling's bound. AQIS2018 Kyoto satellite workshop on quantum computing (2018).
  9. Akibue, S., Kato, G.: Bipartite discrimination of independently prepared quantum states as a counterexample of a parallel repetition conjecture. The 13th Conference on the Theory of Quantum Computation, Communication and Cryptography(TQC2018)(2018)
  10. Rigovacca, L., Kato, G., Baeuml, S., Kim, M. S., Munro, W. J., Azuma, K.: Versatile relative entropy bounds for quantum networks. 8th International Conference on Quantum Cryptography(Qcrypt2018)(2018)

2017

論文

  1. Hatakeyama, Y., Mizutani, A., Kato, G., Imoto, N., Tamaki, K.: Differential-phase-shift quantum key distribution protocol with small number of random delays. Physical Review A, 95, 042301 (2017).
  2. Tani, S.: A fast exact quantum algorithm for solitude verification. Quantum Information & Computation, Vol. 17, No. 1&2, pp. 15-40 (2017).
  3. Karsaklian Dal Bosco, A., Ohara, S., Sato, N., Akizawa, Y., Uchida, A., Harayama, T., Inubushi, M.: Dynamics versus feedback delay time in photonic integrated circuits: Mapping the short cavity regime.
    IEEE Photonics Journal, Vol. 9, Issue 2 (2017).
  4. Ugajin, K., Terashima, Y., Iwakawa, K., Uchida, A., Harayama, T., Yoshimura, K., Inubushi, M.: Real-time fast physical random number generator with a photonic integrated circuit. Optics Express, Vol. 25, No. 6, pp. 6511-6523 (2017).

国際会議

  1. Azuma, K., Mizutani, A., Lo, H.-K., Kato G.: Theory of the quantum internet. Quantum Information Processing (QIP 2017) (2017).
  2. Hayashi, M., Owari, M., Kato G., Cai, N.: Secrecy and Robustness for Active Attack in Secure Network Coding. IEEE International Symposium on Information Theory (ISIT 2017) (2017).
  3. Mano, K., Sakurada, H., Tsukada, Y.: Trust, Trust Me (The Additivity). IFIP WG 11.11 International Conference on Trust Management (IFIPTM 2017) (2017).
  4. Muramatsu, J., Miyake, S.: On the error probability of stochastic decision and stochastic decoding. IEEE International Symposium on Information Theory (ISIT 2017) (2017).

2016

論文

  1. Takahashi, Y., Tani, S., Yamazaki, T., and Tanaka, K.: Commuting quantum circuits with few outputs are unlikely to be classically simulatable. Quantum Information and Computation, Vol.16, No.3&4, pp.251-270 (2016).
  2. Le Gall, F., Nishimura, H., and Tani, S.: Quantum algorithms for finding constant-sized sub- hypergraphs. Theoretical Computer Science, Vol.609, Part 3, pp. 569-582 (2016).
  3. Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., and Sakurada, H.: Semi-automated verification of security proofs of quantum cryptographic protocols. Journal of Symbolic Computation, Vol. 73, pp. 192-220 (2016).
  4. Kawano, Y., and Sekigawa, H.: Quantum Fourier transform over symmetric groups --- improved result, Journal of Symbolic Computation, Vol. 75, pp. 219-243 (2016).
  5. Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., Sakurada, H.: Semi-Automated Verification of Security Proofs of Quantum Cryptographic Protocols. Journal of Symbolic Computation, 73, 192 (2016).
  6. Kato, G., Tamaki, K.: Security of six-state quantum key distribution protocol with threshold detectors. Scientific Reports, 60044 (2016).
  7. Takeuchi, Y. and Takahashi, Y.: Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy. Physical Review A, 94, 062336 (2016).
  8. Takahashi, Y. and Tani, S.: Collapse of the hierarchy of constant-depth exact quantum circuits. Computational Complexity, Vol. 25, Issue 4, pp. 849-881 (2016).
  9. Ambainis, A., Iwama, K., Nakanishi, M., Nishimura, N., Raymond, R., Tani, S., Yamashita, S.: Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Computational Complexity, Vol. 25, No.4, pp. 723-735 (2016).
  10. Tsukada, Y., Sakurada, H., Mano, K., Manabe, Y.: On compositional reasoning about anonymity and privacy in epistemic logic. Annals of Mathematics and Artificial Intelligence, Volume 78, Issue 2, pp. 101-129 (2016).

国際会議

  1. Kato, G., Tamaki, K., Azuma, K., Owari, M.: Security of CV-QKD with transmitted local oscillator.
    Quantum Information Processing (QIP 2016) (2016).
  2. Akibue, S., Owari, M., Kato, G., Murao, M.: Entanglement assisted classical communication simulates “classical communication” without causal order. The International Conference on Quantum Communication, Measurement and Computing (QCMC 2016) (2016).
  3. Fujii, K., Kobayashi, H., Morimae, T., Nishimura, H., Tamate, S., Tani, S.: Power of Quantum Computation with Few Clean Qubits. Proc. 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), pp. 13:1-13:14 (2016).
  4. Sakurada, H., Yoneyama, K., Hanatani, Y., Yoshida, M.: Analyzing and Fixing the QACCE Security of QUIC. Security Standardisation Research (SSR 2016), pp 1-31 (2016).
  5. K. Fujimoto and J. Muramatsu: Active Bayesian observer correcting overconfidence effects due to E-type confirmatory bias. Proc. IEEE International Conference on Systems, Man, and Cybernetics, pp. 1443-1448 (2016).
  6. J. Muramatsu and S. Miyake: Fundamental limits are achievable with countable alphabet. Proc. International Symposium on Information Theory and its Applications, pp. 573-577 (2016).
  7. J. Muramatsu and S. Miyake: Construction of a channel code from an arbitrary source code with side information. Proc. International Symposium on Information Theory and its Applications, pp. 176-180 (2016).

2015

論文

  1. Inubushi, M., Yoshimura, K., Daivs, P.: Noise robustness of unpredictability in a chaotic laser system Toward reliable physical random bit generation. Physical Review E, 91, 022918 (2015).
  2. Inubushi, M., Yoshimura, K., Arai, K., Davis, P.: Physical random bit generators and their reliability focusing on chaotic laser systems. Nonlinear Theory and Its Applications (NOLTA), IEICE, 6, 2 (2015).
  3. Owari, M., Maruyama, K., Takui, T., and Kato, Go.: Probing an untouchable environment as a resource for quantum computing. Physical Review A, 91, 012343 (2015).

国際会議

  1. Inubushi, M., Takehiro, S., Yamada, M.: Covariant Lyapunov analysis and its application to Navier-Stokes flows. Prog. and Abstract Book of The 9th International Conference on Computational Physics (ICCP9), p.121 (2015).
  2. Inubushi, M., Yoshimura, K., Arai, K., Davis, P.: Noise-robustness of physical random bit generation. The 35th Dynamics Days Europe 2015 (2015).
  3. Inubushi, M. and Yoshimura, K.: Memory capacity and time scales in delay dynamical systems for reservoir computing. The 35th Dynamics Days Europe 2015 (2015).
  4. Owari, M., Maruyama, K., and Kato, G.: Probing an untouchable environment as a resource for quantum computing. Quantum Information Processing (QIP 2015) (2015).
  5. Akibue, S., Owari, M., Kato, G., and Murao, M.: Globalness of separable maps in terms of classical indefinite causal correlations. Quantum Information Processing (QIP 2015) (2015).
  6. Takahashi, Y., Tani, S., Yamazaki, T., and Tanaka, K.: Commuting quantum circuits with few outputs are unlikely to be classically simulatable. Proc. of the 21st International Computing and Combinatorics Conference (COCOON 2015), LNCS, Vol.9198, pp.223-234 (2015).
  7. Takahashi, Y.: On the computational power of constant-depth exact quantum circuits. Computability Theory and Foundations of Mathematics (CTFM 2015) (2015).
  8. Tani, S.: Improved hardness results for classically simulating quantum computation models. Workshop on Quantum Computational Complexity (ICALP 2015 Satellite Workshop, Invited talk), (2015).
  9. Miyauchi, M: Track layouts of Graph Subdivisions. 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015) (2015).

書籍、解説記事

  1. 吉村和之, 砂田哲, 新井賢一: 共通ランダム信号による同期現象 位相縮約による理論解析と半導体レーザーにおける実験. レーザー研究, 43巻, 6号, pp.376-380 (2015).
  2. 櫻田英樹: 特集編集にあたって. 電子情報通信学会誌, Vol.98, No.11, p.945 (2015).(小特集「非線形理論とその応用」編集リーダー)

2014

論文

  1. Tamaki, K., Curty, M., Kato, G., Lo, H.-K., Azuma, K.: Loss-tolerant quantum cryptography with imperfect sources. Physical Review A, 90, 052314 (2014)
  2. Kawano, Y. and Sekigawa, H.: Quantum Fourier Transform over Symmetric Groups --- Improved Result. ACM Communications in Computer Algebra, Vol.48, No.3, Issue 189, pp.127-129 (2014).
  3. Tanjo, T. and Minami, K. and Mano, K. and Maruyama, H.: Evaluating data utility of privacy-preserving pseudonymized location datasets. Journal of Wireless Mobile Networks Ubiquitous Computing, and Dependable Applications, Vol.5, No.3, pp.63-78 (2014).
  4. Owari, M. and Hayashi, M.: Asymptotic local hypothesis testing between a pure bipartite state and the completely mixed state. Physical Review A, Vol.90, 032327 (2014).
  5. Takahashi, Y., Yamazaki, T., and Tanaka, K.: Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates. Quantum Information and Computation, Vol.14, No.13&14, pp.1149-1164 (2014).
  6. Kobayashi, H., Matsumoto, K., and Tani, S.: Simpler exact leader election via quantum reduction. Chicago Journal of Theoretical Computer Science, Vol.2014, No.10 (2014).
  7. Shinohara, S., Fukushima, T., Sunada, S., Harayama, T., Arai, K., and Yoshimura, K.: Anticorrelated bidirectional output from quasistadium-based semiconductor microlasers. Optical Review, Vol.21, No.2, pp.113-116 (2014).
  8. Sunada, S., Arai, K., Yoshimura, K., and Adachi, M.: Optical phase synchronization by injection of common broadband low-coherent light. Physical Review Letters, Vol.112, No.20, 204101 (2014).
  9. Takahashi, R., Akizawa, Y., Uchida, A., Harayama, T., Tsuzuki, K., Sunada, S., Arai, K., Yoshimura, K., and Davis, P.: Fast physical random bit generation with photonic integrated circuits with different external cavity lengths for chaos generation. Optics Express, Vol.22, No.10, pp.11727-11740 (2014).
  10. Shinohara, S., Sunada, S., Fukushima, T., Harayama, T., Arai, K., and Yoshimura, K.: Efficient optical path folding by using multiple total internal reflections in a microcavity. Applied Physics Letters, Vol.105, No.15, 151111 (2014).
  11. 藤田邦彦, 塚田恭章: 素性構造に基づいたアクセス制御モデルの提案. 情報処理学会論文誌, Vol.55, No.9, pp.2081-2091 (2014).

国際会議

  1. Inubushi, M., Yoshimura, K., Daivs, P.: Noise-robustness of Random Bit Generations by Chaotic Semiconductor Lasers. Proc. of the 2014 International Symposium on Nonlinear Theory and Its Applications (NOLTA 2014), pp.561-564 (2014).
  2. Akibue, S., Owari,M., Kato, G., and Murao, M.: Globalness of separable maps in terms of classical indefinite causal correlations. 14th Asian Quantum Information Science Conference (AQIS 2014) (2014).
  3. Kawano, Y. and Sekigawa, H.: Quantum Fourier Transform over Symmetric Groups --- Improved Result. Proc. of the International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), pp.31-33 (2014).
  4. Kawano, Y. and Sekigawa, H: Quantum Fourier Transform over Symmetric Groups --- Improved Result. XVIII Conference on Quantum Information Processing (QIP 2014) (2014).
  5. Tanjo, T., Minami, K., Mano, K., and Maruyama, H.: On Safety of Pseudonym-based Location Data in the Context of Constraint Satisfation Problems. Proc. of the 2014 Asian Conference on Availability, Reliability and Security (AsiaARES 2014), pp.511-520 (2014).
  6. Mano, K. and Minami, K. and Maruyama, H.: Pseudonym Exchange for Privacy-Preserving Publishing of Trajectory Data Set. Proc. of 2014 IEEE 3rd Global Conference on Consumer Electronics (GCCE 2014), pp.691-695 (2014).
  7. Miyauchi, M.: Track layouts of Graph Subdivisions. Proc. of the 17th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2014), pp.145--149 (2014).
  8. Sakurada, H.: Computational Soundness of Symbolic Blind Signatures under Active Attacker. Foundations and Practice of Security (6th International symposium, FPS 2013, La Rochelle, France, October 21-22, 2013, Revised Selected Papers), LNCS, Vol.8352, pp.247-263 (2014).
  9. Le Gall, F., Nishimura, H., and Tani, S.: Quantum algorithms for finding constant-sized sub-hypergraph. Proc. of the 20th International Computing and Combinatorics Conference (COCOON 2014), LNCS, Vol.8591, pp.429-440 (2014).
  10. Doi, Y. and Yoshimura, K.: Constructing a lattice model supporting highly mobile discrete breathers. Proc. of the 2014 International Symposium on Nonlinear Theory and Its Applications (NOLTA 2014), pp.401-403 (2014).
  11. Kakesu, I., Suzuki, N., Uchida, A., Yoshimura, K., Arai, K., and Davis, P.: Frequency dependence of common-signal-induced synchronization in semiconductor lasers with constant-amplitude and random-phase light. Proc. of the 2014 International Symposium on Nonlinear Theory and Its Applications (NOLTA 2014), pp.466-469 (2014).
  12. Sunada, S., Arai, K., Yoshimura, K., and Adachi, M.: Common noise-induced optical phase synchronization in lasers. Proc. of the 2014 International Symposium on Nonlinear Theory and Its Applications (NOLTA 2014), pp.470-473 (2014).
  13. Arai, K., Yoshimura, K., Sunada, S., and Uchida, A.: Synchronization induced by common ASE noise in semiconductor lasers. Proc. of the 2014 International Symposium on Nonlinear Theory and Its Applications (NOLTA 2014), pp.474-477 (2014).
  14. Yoshimura, K., Uchida, A., Muramatsu, J., and Davis, P.: Spectral characteristics of consistency of a single-mode semiconductor laser injected with broadband random light. Proc. of the 2014 International Symposium on Nonlinear Theory and Its Applications (NOLTA 2014), pp.545-548 (2014).

書籍、解説記事

  1. Yoshimura, K., Doi, Y. and Kimura, M.: Localized modes in nonlinear discrete systems. in M. Ohtsu and T. Yatsui (ed.), Progress in Nanophotonics 3, Chap. 4 (Springer-Verlag, Berlin Heidelberg, 2014).
  2. 高橋康博:量子回路と古典回路の相違:加算回路を例として. 情報処理学会誌 「情報処理」, Vol.55, No.7, pp.689-694 (2014).
  3. 高橋康博:ステップ数の少ない量子回路の計算能力. 電子情報通信学会誌, Vol.97, No.12, pp.1110-1114 (2014).
  4. 内田淳史, 吉村和之, 村松純, デイビス ピーター, 原山卓久, 砂田哲: 半導体レーザーのランダム現象を用いた超高速物理乱数生成と相関乱数秘密鍵配送. 日本光学会機関誌「光学」 43巻, 5号 (2014).

2013

  1. Takahashi, Y., Yamazaki, T., and Tanaka, K.: Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates. Proc. of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), Lecture Notes in Computer Science 8087, pp.801-812 (2013).
  2. Takahashi, Y., and Tani, S.: Collapse of the hierarchy of constant-depth exact quantum circuits. Proc. of the 28th IEEE Conference on Computational Complexity (CCC 2013), pp.168-178 (2013).
  3. Owari M., Maruyama K., and Kato G.: Probing an untouchable environment as a resource for quantum. Workshop on Quantum Metrology, Interaction, and Causal Structure (2013).
  4. Kato G.: Analytical Optimization of Local Quantum Operation and Classical Communication. Math-for-Industry (2013).
  5. Owari M., Maruyama K., Takui T., and Kato G.: Probing an untouchable environment as a resource for quantum computing. NIC@QS (2013).
  6. Kato G., Tamaki K., Azuma K., and Owari M.: Security of CV-QKD with transmitted local oscillator. QCrypt (2013).
  7. Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., and Sakurada, H.: Automated Verification of Equivalence on Quantum Cryptographic Protocols. Proc. of SCSS 2013 Symbolic Computation in Software Science 5th International Symposium, pp.64-69 (2013).
  8. Kawano, Y. and Sekigawa, H.: Quantum Fourier Transform over Symmetric Groups. Proc. of the International Symposium on Symbolic and Algebraic Computation (ISSAC 2013), pp. 227-234 (2013).
  9. Kubota, T., Kakutani, Y., Kato, G., Kawano, Y., and Sakurada, H.: Automated Verification of Equivalence on Quantum Cryptographic Protocols. Proc. of SCSS 2013 Symbolic Computation in Software Science 5th International Symposium, pp.64-69 (2013).
  10. Mano, K., Minami, K., and Maruyama, H.: Privacy-preserving publishing of pseudonym-based trajectory location data set. The 2nd International Workshop on Security of Mobile Applications (IWSMA 2013) , (2013).
  11. Mano, K., Minami, K., and Maruyama, H.: Protecting Location Privacy with K-Confusing Paths Based on Dynamic Pseudonyms. 5th IEEE International Workshop on Security and Social Networking (SESOC 2013), pp. 285-290 (2013).
  12. Tsukada, Y., Sakurada, H., Mano, K., and Manabe, Y.: An Epistemic Approach to Compositional Reasoning about Anonymity and Privacy. Proc. of 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), pp.239-248 (2013).
  13. Mitsunaga, T., Manabe, Y., and Okamoto, T.: Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption. IEICE Transactions on Fundamentals of electronics, communications and computer sciences, Vol.E96-A, No.1, pp.68-75 (2013).

2012

  1. Cleve, R., Iwama, K., Le Gall, F., Nishimura, H., Tani, S., Teruyama, J., and Yamashita, S.: Reconstructing strings from substrings with quantum queries. Proc. of Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2013), Lecture Notes in Computer Science 7357, pp. 388-397 (2012).
  2. Kubota, T., Kakutani, T., Kato G., Kawano, Y., and Sakurada, H.: Application of a Process Calculus to Security Proofs of Quantum Protocols, The 2012 International Conference on Foundations of Computer Science, in press (2012).
  3. Tani, S. and Kobayashi, H., and Matsumoto, K.: Exact quantum algorithms for the leader election problem. ACM Transactions on Computation Theory, Vol.4, No.1, Article 1 (2012).
  4. Tani, S.: Compression of View on Anonymous Networks -- Folded View --. IEEE Transactions on Parallel and Distributed Systems, Vol.23, No.2, pp.255-262 (2012).
  5. Owari, M., Hayashi, M.: Asymptotic local hypothesis testing between a pure bipartite state and the completely mixed state, The 2nd Institute of Mathematical Statistics, Asia Pacific Rim Meeting (2012).
  6. Kato, G., Maruyama, K., Owari, M.: The Environment Tomography, The 2nd Institute of Mathematical Statistics, Asia Pacific Rim Meeting (2012).
  7. Azuma, A., Kato, G.: Optimal entanglement manipulation via coherent-state transmission, Physical Review A (PRA) 85, 060303(R) (2012).
  8. Fujita, K. and Tsukada, Y.: An approach to the formal analysis of license interoperability, Elsevier, Computers and Electrical Engineering, Vol. 38, No. 6, pp. 1670-1686 (2012).
  9. Bana, G, Adão, Sakurada, H.: Computationally Complete Symbolic Attacker in Action. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), pp.546-560 (2012).
  10. Adão, P., Bana, G., and Sakurada, H.: Computationally Sound Verification of the NSL Protocol via Computationally Complete Symbolic Attacker (Abstract). Eighth Workshop on Formal and Computational Cryptography (FCC 2012) (2012).
  11. Manabe, Y. and Okamoto, T.: Meta-envy-free Cake-cutting and Pie-cutting Protocols. Journal of Information Processing, Vol.20, No.3, pp.686-693 (2012).
  12. Kiyoshima, S., Manabe, Y., and Okamoto, T.: Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security. Proc. of 7th International Workshop on Security (IWSEC2012), LNCS Vol.7631, pp.216-232 (2012).
  13. Manabe, Y. and Okamoto, T.: Meta-envy-free Cake-cutting and Pie-cutting Protocols. Journal of Information Processing, Vol.20, No.3, in press (2012).
  14. Comon-Lundh, H., Hagiya, M., Kawamoto, Y., Sakurada, H.: Computational Soundness of Indistinguishability Properties without Computable Parsing. The 8th International Conference on Information Security Practice and Experience (ISPEC 2012), Lecture Notes in Computer Science, Vol.7232, pp.63-79 (2012).
  15. 竹内泉, 真野健: 確率様相論理による秘匿性の証明. 応用数理学会論文誌, Vol.22, No.1, pp.23-45 (2012).
  16. Bana, G. and Comon-Lundh, H.: Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. Proc. of the First International Conference on Principles of Security and Trust (POST 2012), Springer LNCS, Vol.7215, pp.189-208 (2012).
  17. Manabe, Y. and Okamoto, T.: A Cryptographic Moving-knife Cake-Cutting Protocol. Proc. of International Workshop on Interactions, Games and Protocols (iWIGP2012), EPTCS Vol.78, pp.15-23 (2012).
  18. Hermanto, Manabe, Y., and Okamoto, T.: A Simplified Private Stable Matching Algorithm. Financial Cryptography and Data Security (FC 2012) (2012).

メンバー

Page top ←