Takashi Yamakawa

Orcid: 0000-0003-1712-3026

According to our database1, Takashi Yamakawa authored at least 68 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
NIZK from SNARGs.
J. Cryptol., April, 2023

Quantum Advantage from One-Way Functions.
IACR Cryptol. ePrint Arch., 2023

Revocable Quantum Digital Signatures.
IACR Cryptol. ePrint Arch., 2023

Unconditionally Secure Commitments with Quantum Auxiliary Inputs.
IACR Cryptol. ePrint Arch., 2023

Publicly Verifiable Deletion from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2023

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions.
IACR Cryptol. ePrint Arch., 2023

Robust Combiners and Universal Constructions for Quantum Cryptography.
IACR Cryptol. ePrint Arch., 2023

Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More.
IACR Cryptol. ePrint Arch., 2023

Quantum Complexity for Discrete Logarithms and Related Problems.
IACR Cryptol. ePrint Arch., 2023

Obfuscation of Pseudo-Deterministic Quantum Circuits.
IACR Cryptol. ePrint Arch., 2023

Public Key Encryption with Secure Key Leasing.
IACR Cryptol. ePrint Arch., 2023

A Note on Output Length of One-Way State Generators.
CoRR, 2023

Classical vs Quantum Advice under Classically-Accessible Oracle.
CoRR, 2023

2022
Verifiable Quantum Advantage without Structure.
IACR Cryptol. ePrint Arch., 2022

One-Wayness in Quantum Cryptography.
IACR Cryptol. ePrint Arch., 2022

Classically Verifiable NIZK for QMA with Preprocessing.
IACR Cryptol. ePrint Arch., 2022

Proofs of Quantumness from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2022

A New Approach to Post-Quantum Non-Malleability.
IACR Cryptol. ePrint Arch., 2022

Certified Everlasting Functional Encryption.
IACR Cryptol. ePrint Arch., 2022

From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments.
IACR Cryptol. ePrint Arch., 2022

Bounded Functional Encryption for Turing Machines: Adaptive Security from General Assumptions.
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

Quantum Encryption with Certified Deletion: Public Key and Attribute-Based.
IACR Cryptol. ePrint Arch., 2021

Quantum commitments and signatures without one-way functions.
IACR Cryptol. ePrint Arch., 2021

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

Certified Everlasting Zero-Knowledge Proof for QMA.
IACR Cryptol. ePrint Arch., 2021

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication.
IACR Cryptol. ePrint Arch., 2021

Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round.
IACR Cryptol. ePrint Arch., 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2021

Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing.
CoRR, 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Generic hardness of inversion on ring and its relation to self-bilinear map.
Theor. Comput. Sci., 2020

Classical vs Quantum Random Oracles.
IACR Cryptol. ePrint Arch., 2020

A Note on Separating Classical and Quantum Random Oracles.
IACR Cryptol. ePrint Arch., 2020

Secure Software Leasing from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2020

NIZK from SNARG.
IACR Cryptol. ePrint Arch., 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

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

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2020

Classical Verification of Quantum Computations with Efficient Verifier.
IACR Cryptol. ePrint Arch., 2020

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round.
CoRR, 2020

2019
Leakage-resilient Identity-based Encryption in Bounded Retrieval Model with Nearly Optimal Leakage-Ratio.
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

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

Adaptively Single-Key Secure Constrained PRFs for \mathrm NC^1.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

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

Adaptively Secure and Succinct Functional Encryption: Improving Security and Efficiency, Simultaneously.
IACR Cryptol. ePrint Arch., 2018

Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness.
IACR Cryptol. ePrint Arch., 2018

Adaptively Single-Key Secure Constrained PRFs for NC1.
IACR Cryptol. ePrint Arch., 2018

Constrained PRFs for NC1 in Traditional Groups.
IACR Cryptol. ePrint Arch., 2018

Constrained PRFs for \mathrmNC^1 in Traditional Groups.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Towards Ideal Self-bilinear Map.
Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018

2017
Partially Wildcarded Ciphertext-Policy Attribute-Based Encryption and Its Performance Evaluation.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

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

Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications.
Algorithmica, 2017

2016
Efficient key encapsulation mechanisms with tight security reductions to standard assumptions in the two security models.
Secur. Commun. Networks, 2016

Adversary-dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli.
IACR Cryptol. ePrint Arch., 2016

Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information.
Proceedings of the Information Security and Privacy - 21st Australasian Conference, 2016

2014
Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

A Short Fail-Stop Signature Scheme from Factoring.
Proceedings of the Provable Security - 8th International Conference, 2014

2013
Partially Wildcarded Attribute-based Encryption and Its Efficient Construction.
Proceedings of the SECRYPT 2013, 2013

Reducing Public Key Sizes in Bounded CCA-Secure KEMs with Optimal Ciphertext Length.
Proceedings of the Information Security, 16th International Conference, 2013

Efficient variants of the Naor-Yung and Dolev-Dwork-Naor transforms for CCA secure key encapsulation mechanism.
Proceedings of the first ACM workshop on Asia public-key cryptography, 2013

1998
STM Publications in Japan - a market analysis.
Learn. Publ., 1998


  Loading...