Shota Yamada

Orcid: 0000-0002-7338-686X

Affiliations:
  • National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan


According to our database1, Shota Yamada authored at least 76 papers between 2010 and 2024.

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

2024
Compact NIZKs from Standard Assumptions on Bilinear Maps.
J. Cryptol., September, 2024

Attribute-Based Signatures for Circuits with Optimal Parameter Size from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2024

Tighter Adaptive IBEs and VRFs: Revisiting Waters' Artificial Abort.
IACR Cryptol. ePrint Arch., 2024

Pseudorandom Multi-Input Functional Encryption and Applications.
IACR Cryptol. ePrint Arch., 2024

Compact Pseudorandom Functional Encryption from Evasive LWE.
IACR Cryptol. ePrint Arch., 2024

Attribute Based Encryption for Turing Machines from Lattices.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

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

Constant Input Attribute Based (and Predicate) Encryption from Evasive and Tensor LWE.
IACR Cryptol. ePrint Arch., 2023

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

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

Broadcast, Trace and Revoke with Optimal Parameters from Polynomial Hardness.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
How to Extend CTRT for AES-256 and AES-192.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., August, 2022

Multi-Input Attribute Based Encryption and Predicate Encryption.
IACR Cryptol. ePrint Arch., 2022

Trace and Revoke with Optimal Parameters from Polynomial Hardness.
IACR Cryptol. ePrint Arch., 2022

Bounded Functional Encryption for Turing Machines: Adaptive Security from General Assumptions.
IACR Cryptol. ePrint Arch., 2022

Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013.
Des. Codes Cryptogr., 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

Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE.
IACR Cryptol. ePrint Arch., 2021

Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

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

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

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

CP-ABE for Circuits (and more) in the Symmetric Key Setting.
IACR Cryptol. ePrint Arch., 2020

Optimal Broadcast Encryption from Pairings and LWE.
IACR Cryptol. ePrint Arch., 2020

Optimal Broadcast Encryption from LWE and Pairings in the Standard Model.
IACR Cryptol. ePrint Arch., 2020

Semantic Definition of Anonymity in Identity-Based Encryption and Its Relation to Indistinguishability-Based Definition.
Proceedings of the Computer Security - ESORICS 2020, 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

Attribute Based Encryption for Deterministic Finite Automata from DLIN.
IACR Cryptol. ePrint Arch., 2019

Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE.
IACR Cryptol. ePrint Arch., 2019

An Extended CTRT for AES-256.
Proceedings of the Information Security Applications - 20th International Conference, 2019

Attribute Based Encryption for Deterministic Finite Automata from \mathsfDLIN.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

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

2018
Attribute-Based Encryption for Range Attributes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

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

Constrained PRFs for Bit-fixing from OWFs with Constant Collusion Resistance.
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

Chosen ciphertext secure keyed-homomorphic public-key cryptosystems.
Des. Codes Cryptogr., 2018

Secure Division Protocol and Applications to Privacy-preserving Chi-squared Tests.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Tree-based Secure Comparison of Secret Shared Data.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Embedding Lemmas for Functional Encryption.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

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

2017
Private Similarity Searchable Encryption for Euclidean Distance.
IEICE Trans. Inf. Syst., 2017

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

New Security Proof for the Boneh-Boyen IBE: Tight Reduction in Unbounded Multi-Challenge Security.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques.
IACR Cryptol. ePrint Arch., 2017

Efficient Public Trace and Revoke from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2017

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

Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

A Survey on Identity-Based Encryption from Lattices.
Proceedings of the Mathematical Modelling for Next-Generation Cryptography: CREST Crypto-Math Project, 2017

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

Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters.
IACR Cryptol. ePrint Arch., 2016

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

Attribute Based Encryption with Direct Efficiency Tradeoff.
Proceedings of the Applied Cryptography and Network Security, 2016

2015
A Framework for Identity-Based Encryption with Almost Tight Security.
IACR Cryptol. ePrint Arch., 2015

Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings.
IACR Cryptol. ePrint Arch., 2015

Conversions among Several Classes of Predicate Encryption and Their Applications.
IACR Cryptol. ePrint Arch., 2015

Conversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 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

2013
Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2013

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

Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 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

2012
Space Efficient Signature Schemes from the RSA Assumption.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

2011
Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

2010
Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption.
Proceedings of the Provable Security - 4th International Conference, 2010


  Loading...