Ryo Nishimaki

Orcid: 0000-0002-5144-4619

According to our database1, Ryo Nishimaki authored at least 64 papers between 2008 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
Compact Structure-Preserving Signatures with Almost Tight Security.
J. Cryptol., October, 2023

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

One-out-of-Many Unclonable Cryptography: Definitions, Constructions, and More.
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

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

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

2022
Obfustopia Built on Secret-Key Functional Encryption.
J. Cryptol., 2022

Functional Encryption with Secure Key Leasing.
IACR Cryptol. ePrint Arch., 2022

Watermarking PRFs against Quantum Adversaries.
IACR Cryptol. ePrint Arch., 2022

Certified Everlasting Functional Encryption.
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
Simple and Generic Constructions of Succinct Functional Encryption.
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

The Direction of Updatable Encryption Does Matter.
IACR Cryptol. ePrint Arch., 2021

KDM Security for the Fujisaki-Okamoto Transformations in the QROM.
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

Fast, compact, and expressive attribute-based encryption.
Des. Codes Cryptogr., 2021

2020
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption.
J. Cryptol., 2020

Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark).
IACR Cryptol. ePrint Arch., 2020

Secure Software Leasing from Standard Assumptions.
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

2019
How to Watermark Cryptographic Functions by Bilinear Maps.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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

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

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

Universal Proxy Re-Encryption.
IACR Cryptol. ePrint Arch., 2018

A Bit-fixing PRF with O(1) Collusion-Resistance from LWE.
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

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

2017
From Single-Key to Collusion-Resistant Secret-Key Functional Encryption by Leveraging Succinctness.
IACR Cryptol. ePrint Arch., 2017

Indistinguishability Obfuscation for All Circuits from Secret-Key Functional Encryption.
IACR Cryptol. ePrint Arch., 2017

Indistinguishability Obfuscation: Simpler Constructions using Secret-Key Functional Encryption.
IACR Cryptol. ePrint Arch., 2017

2016
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions.
J. Cryptol., 2016

Watermarking Cryptographic Programs.
Proceedings of the Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, 2016

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

Post-Challenge Leakage Resilient Public-Key Cryptosystem in Split State Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key.
IACR Cryptol. ePrint Arch., 2015

Watermarking Cryptographic Programs Against Arbitrary Removal Strategies.
IACR Cryptol. ePrint Arch., 2015

Generalizing Efficient Multiparty Computation.
IACR Cryptol. ePrint Arch., 2015

Watermarking Cryptographic Capabilities.
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

Tagged One-Time Signatures: Tight Security and Optimal Tag Size.
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

2014
How to Watermark Cryptographic Functions.
IACR Cryptol. ePrint Arch., 2014

2013
Universally composable adaptive oblivious transfer (with access control) from standard assumptions.
Proceedings of the DIM'13, 2013

2012
A Multi-Trapdoor Commitment Scheme from the RSA Assumption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

An Efficient Non-interactive Universally Composable String-Commitment Scheme.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

2010
CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model.
Proceedings of the Public Key Cryptography, 2010

2009
Efficient Non-interactive Universally Composable String-Commitment Schemes.
Proceedings of the Provable Security, Third International Conference, 2009

On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions.
Proceedings of the Provable Security, Third International Conference, 2009

Security on Hybrid Encryption with the Tag-KEM/DEM Framework.
Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

2008
Universally Composable Identity-Based Encryption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008


  Loading...