Shuichi Katsumata

Orcid: 0000-0002-8496-0476

According to our database1, Shuichi Katsumata authored at least 43 papers between 2015 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions.
IACR Cryptol. ePrint Arch., 2024

2023
Direct computation of branching programs and its applications to more efficient lattice-based cryptography.
Des. Codes Cryptogr., February, 2023

Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2023

Breaking Parallel ROS: Implication for Isogeny and Lattice-based Blind Signatures.
IACR Cryptol. ePrint Arch., 2023

CSI-Otter: Isogeny-based (Partially) Blind Signatures from the Class Group Action with a Twist.
IACR Cryptol. ePrint Arch., 2023

Group signatures and more from isogenies and lattices: generic, simple, and efficient.
Des. Codes Cryptogr., 2023

Signature for Objects: Formalizing How to Authenticate Physical Data and More.
Proceedings of the Financial Cryptography and Data Security, 2023

2022
Identity-based encryption with security against the KGC: A formal model and its instantiations.
Theor. Comput. Sci., 2022

An Efficient and Generic Construction for Signal's Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable.
J. Cryptol., 2022

A New Framework For More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling.
IACR Cryptol. ePrint Arch., 2022

How to Hide MetaData in MLS-Like Secure Group Messaging: Simple, Modular, and Post-Quantum.
IACR Cryptol. ePrint Arch., 2022

2021
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model.
J. Cryptol., 2021

Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings.
J. Cryptol., 2021

Round-Optimal Blind Signatures in the Plain Model from Classical and Quantum Standard Assumptions.
IACR Cryptol. ePrint Arch., 2021

A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs.
IACR Cryptol. ePrint Arch., 2021

A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs.
IACR Cryptol. ePrint Arch., 2021

Statistical ZAPs from Group-Based Assumptions.
IACR Cryptol. ePrint Arch., 2021

Revisiting Fuzzy Signatures: Towards a More Risk-Free Cryptographic Authentication System based on Biometrics.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance.
Theor. Comput. Sci., 2020

Exposing Private User Behaviors of Collaborative Filtering via Model Inversion Techniques.
Proc. Priv. Enhancing Technol., 2020

Adaptively Secure Inner Product Encryption from LWE.
IACR Cryptol. ePrint Arch., 2020

Compact NIZKs from Standard Assumptions on Bilinear Maps.
IACR Cryptol. ePrint Arch., 2020

Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications.
IACR Cryptol. ePrint Arch., 2020

Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512.
IACR Cryptol. ePrint Arch., 2020

Adaptively Secure Constrained Pseudorandom Functions in the Standard Model.
IACR Cryptol. ePrint Arch., 2020

Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions.
IACR Cryptol. ePrint Arch., 2020

Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices.
IACR Cryptol. ePrint Arch., 2020

2019
Group Signatures without NIZK: From Lattices in the Standard Model.
IACR Cryptol. ePrint Arch., 2019

Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman Assumptions.
IACR Cryptol. ePrint Arch., 2019

Exploring Constructions of Compact NIZKs from Various Assumptions.
IACR Cryptol. ePrint Arch., 2019

Non-Zero Inner Product Encryption Schemes from Various Assumptions: LWE, DDH and DCR.
IACR Cryptol. ePrint Arch., 2019

Identity-Based Encryption with Security Against the KGC: A Formal Model and Its Instantiation from Lattices.
Proceedings of the Computer Security - ESORICS 2019, 2019

2018
Model Inversion Attacks for Online Prediction Systems: Without Knowledge of Non-Sensitive Attributes.
IEICE Trans. Inf. Syst., 2018

Attribute-Based Signatures for Unbounded Languages from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2018

Note on Constructing Constrained PRFs from OWFs with Constant Collusion Resistance.
IACR Cryptol. ePrint Arch., 2018

Attribute-based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices.
IACR Cryptol. ePrint Arch., 2018

Constrained PRFs for Bit-fixing from OWFs with Constant Collusion Resistance.
IACR Cryptol. ePrint Arch., 2018

Anonymous Reputation Systems Achieving Full Dynamicity from Lattices.
Proceedings of the Financial Cryptography and Data Security, 2018

2017
Constructing Subspace Membership Encryption through Inner Product Encryption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications.
IACR Cryptol. ePrint Arch., 2017

Model Inversion Attacks for Prediction Systems: Without Knowledge of Non-Sensitive Attributes.
Proceedings of the 15th Annual Conference on Privacy, Security and Trust, 2017

2016
Partitioning via Non-Linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps.
IACR Cryptol. ePrint Arch., 2016

2015
Robust Cost Sensitive Support Vector Machine.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015


  Loading...