Keita Xagawa

Orcid: 0000-0002-6832-9940

According to our database1, Keita Xagawa authored at least 50 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Multiple-Valued Plaintext-Checking Side-Channel Attacks on Post-Quantum KEMs.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Signatures with Memory-Tight Security in the Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch., 2023

On the Efficiency of Generic, Quantum Cryptographic Constructions.
IACR Cryptol. ePrint Arch., 2023

Making the Identity-Based Diffie-Hellman Key Exchange Efficiently Revocable.
Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

2022
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

Post-Quantum Anonymity of Kyber.
IACR Cryptol. ePrint Arch., 2022

Probabilistic Hash-and-Sign with Retry in the Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch., 2022

Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013.
Des. Codes Cryptogr., 2022

2021
Fault-Injection Attacks against NIST's Post-Quantum Cryptography Round 3 KEM Candidates.
IACR Cryptol. ePrint Arch., 2021

Anonymity of NIST PQC Round-3 KEMs.
IACR Cryptol. ePrint Arch., 2021

The Boneh-Katz Transformation, Revisited: Pseudorandom/Obliviously-Samplable PKE from Lattices and Codes and Its Application.
IACR Cryptol. ePrint Arch., 2021

2020
Quantum algorithm for the multicollision problem.
Theor. Comput. Sci., 2020

Non-Committing Encryption with Constant Ciphertext Expansion from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2020

Cryptanalysis of a rank-based signature with short public keys.
Des. Codes Cryptogr., 2020

2019
Cryptanalysis of a New Code-based Signature Scheme with Shorter Public Key in PKC 2019.
IACR Cryptol. ePrint Arch., 2019

Quantum Random Oracle Model with Auxiliary Input.
IACR Cryptol. ePrint Arch., 2019

Post-Quantum Provably-Secure Authentication and MAC from Mersenne Primes.
IACR Cryptol. ePrint Arch., 2019

ModFalcon: compact signatures based on module NTRU lattices.
IACR Cryptol. ePrint Arch., 2019

2018
Accumulable optimistic fair exchange from verifiably encrypted homomorphic signatures.
Int. J. Inf. Sec., 2018

(Tightly) QCCA-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch., 2018

Practical Attack on RaCoSS-R.
IACR Cryptol. ePrint Arch., 2018

Improved Quantum Multicollision-Finding Algorithm.
IACR Cryptol. ePrint Arch., 2018

Cryptanalysis of Compact-LWE.
Proceedings of the Topics in Cryptology - CT-RSA 2018, 2018

2017
Practical Cryptanalysis of a Public-key Encryption Scheme Based on Non-linear Indeterminate Equations at SAC 2017.
IACR Cryptol. ePrint Arch., 2017

Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch., 2017

Quantum Multicollision-Finding Algorithm.
IACR Cryptol. ePrint Arch., 2017

Cryptanalysis of Comparable Encryption in SIGMOD'16.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

2016
Groth-Sahai Proofs Revisited Again: A Bug in "Optimized" Randomization.
IACR Cryptol. ePrint Arch., 2016

Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Key-Private Proxy Re-Encryption from Lattices, Revisited.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Improved (Hierarchical) Inner-Product Encryption from Lattices.
IACR Cryptol. ePrint Arch., 2015

Note on the RKA security of Continuously Non-Malleable Key-Derivation Function from PKC 2015.
IACR Cryptol. ePrint Arch., 2015

Re-encryption, functional re-encryption, and multi-hop re-encryption: A framework for achieving obfuscation-based security and instantiations from lattices.
IACR Cryptol. ePrint Arch., 2015

Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES.
Des. Codes Cryptogr., 2015

Strongly secure authenticated key exchange from factoring, codes, and lattices.
Des. Codes Cryptogr., 2015

Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions.
Proceedings of the Progress in Cryptology - LATINCRYPT 2015, 2015

2014
Secure Hierarchical Identity-Based Identification without Random Oracles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Non-malleable Multiple Public-Key Encryption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

2013
Message Authentication Codes Secure against Additively Related-Key Attacks.
IACR Cryptol. ePrint Arch., 2013

Cryptanalysis of the Huang-Liu-Yang Cryptosystem from PKC 2012.
IACR Cryptol. ePrint Arch., 2013

Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism.
Proceedings of the 8th ACM Symposium on Information, Computer and Communications Security, 2013

2012
Security Enhancement of Identity-Based Identification with Reversibility.
Proceedings of the Information and Communications Security - 14th International Conference, 2012

Applicability of OR-Proof Techniques to Hierarchical Identity-Based Identification.
Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

Security Enhancements by OR-Proof in Identity-Based Identification.
Proceedings of the Applied Cryptography and Network Security, 2012

2010
Security of Encryption Schemes in Weakened Random Oracle Models.
IACR Cryptol. ePrint Arch., 2010

2009
Efficient Public Key Encryption Based on Ideal Lattices.
IACR Cryptol. ePrint Arch., 2009

Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge.
Proceedings of the Provable Security, Third International Conference, 2009

2008
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems.
Proceedings of the Advances in Cryptology, 2008

2007
Multi-bit Cryptosystems Based on Lattice Problems.
Proceedings of the Public Key Cryptography, 2007


  Loading...