Keisuke Tanaka

From MaRDI portal
Person:671623

Available identifiers

zbMath Open tanaka.keisukeMaRDI QIDQ671623

List of research outcomes





PublicationDate of PublicationType
Universally composable relaxed asymmetric password-authenticated key exchange2025-01-10Paper
1-out-of-\(n\) oblivious signatures: security revisited and a generic construction with an efficient communication cost2024-05-31Paper
Auditable attribute-based credentials scheme and its application in contact tracing2024-05-31Paper
Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields2023-08-21Paper
Pointcheval-Sanders signature-based synchronized aggregate signature2023-08-21Paper
Turn-based communication channels2023-04-13Paper
Watermarkable signature with computational function preserving2023-03-21Paper
Receiver selective opening CCA secure public key encryption from various assumptions2023-03-21Paper
Non-committing encryption with constant ciphertext expansion from standard assumptions2023-03-21Paper
Approximation and special cases of common subtrees and editing distance2023-01-25Paper
Forward secure message franking2022-12-07Paper
Efficient two-party exponentiation from quotient transfer2022-11-09Paper
Generic constructions for fully secure revocable attribute-based encryption2022-08-25Paper
Payment trees: low collateral payments for payment channel networks2022-06-22Paper
Obfustopia built on secret-key functional encryption2022-06-08Paper
CCA security and trapdoor functions via key-dependent-message security2022-04-04Paper
Security definitions on time-lock puzzles2022-03-24Paper
Secret sharing with statistical privacy and computational relaxed non-malleability2022-03-24Paper
Generic transformation from broadcast encryption to round-optimal deniable ring authentication2022-03-21Paper
Impossibility on tamper-resilient cryptography with uniqueness properties2021-12-21Paper
Tightly secure ring signatures in the standard model2021-10-21Paper
Fine-grained cryptography revisited2021-07-30Paper
Simple and generic constructions of succinct functional encryption2021-07-30Paper
Improved security proof for the Camenisch-Lysyanskaya signature-based synchronized aggregate signature scheme2021-06-08Paper
A t-out-of-n Redactable Signature Scheme2020-07-20Paper
Fine-grained cryptography revisited2020-05-11Paper
Simple and efficient KDM-CCA secure public key encryption2020-05-11Paper
Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem2020-05-11Paper
Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously2020-03-09Paper
CCA security and trapdoor functions via key-dependent-message security2020-03-09Paper
Anonymous single-round server-aided verification2020-03-02Paper
Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions2019-10-18Paper
A framework for achieving KDM-CCA secure public-key encryption2019-01-23Paper
Group signature with deniability: how to disavow a signature2018-10-26Paper
Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes2018-10-24Paper
Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions2018-10-17Paper
Fully anonymous group signature with verifier-local revocation2018-10-17Paper
CCA2 key-privacy for code-based encryption in the standard model2018-09-12Paper
Memory lower bounds of reductions revisited2018-07-09Paper
Obfustopia built on secret-key functional encryption2018-07-09Paper
Simple and generic constructions of succinct functional encryption2018-05-29Paper
Key dependent message security and receiver selective opening security for identity-based encryption2018-05-16Paper
How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones2017-01-06Paper
Signatures Resilient to Uninvertible Leakage2016-10-21Paper
On the complexity of negation-limited Boolean networks (preliminary version)2016-09-01Paper
On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions2016-04-13Paper
Completeness of Single-Bit Projection-KDM Security for Public Key Encryption2016-03-02Paper
Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Continuous Leakage Resiliency2015-10-20Paper
Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Leakage Resiliency2015-09-29Paper
Efficient Key Dependent Message Security Amplification Against Chosen Ciphertext Attacks2015-09-11Paper
Game-Theoretic Security for Bit Commitment2014-09-15Paper
Attacks to the Proxy Re-Encryption Schemes from IWSEC20112014-09-15Paper
Strongly Simulation-Extractable Leakage-Resilient NIZK2014-07-24Paper
Factoring-Based Proxy Re-Encryption Schemes2013-10-23Paper
Grey-Box Public-Key Steganography2013-05-28Paper
Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability2013-04-04Paper
Proxy Re-Encryption in a Stronger Security Model Extended from CT-RSA20122013-03-18Paper
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees2013-02-19Paper
Leakage-Resilience of Stateless/Stateful Public-Key Encryption from Hash Proofs2012-09-07Paper
A Game-Theoretic Perspective on Oblivious Transfer2012-09-07Paper
Weak Oblivious Transfer from Strong One-Way Functions2011-09-16Paper
Randomness Leakage in the KEM/DEM Framework2011-09-16Paper
Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity2011-05-19Paper
A Multi-trapdoor Commitment Scheme from the RSA Assumption2010-10-25Paper
CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model2010-05-28Paper
Security of Encryption Schemes in Weakened Random Oracle Models2010-05-28Paper
Efficient public key encryption based on ideal lattices (extended abstract)2009-12-15Paper
Efficient non-interactive universally composable string-commitment schemes2009-12-11Paper
Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge2009-12-11Paper
On the insecurity of the Fiat-Shamir signatures with iterative hash functions2009-12-11Paper
Algorithms and Computation2009-08-07Paper
Limiting negations in bounded-depth circuits: an extension of Markov's theorem2009-07-21Paper
Multi-recipient Public-Key Encryption from Simulators in Security Proofs2009-06-25Paper
On the Weak Ideal Compression Functions2009-06-25Paper
Security on Hybrid Encryption with the Tag-KEM/DEM Framework2009-06-25Paper
Public Key Cryptography – PKC 20042009-05-14Paper
Anonymity on Paillier’s Trap-Door Permutation2009-03-06Paper
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems2009-02-10Paper
Public-Key Cryptosystems with Primitive Power Roots of Unity2008-07-08Paper
Universally Anonymizable Public-Key Encryption2008-03-18Paper
Security of Digital Signature Schemes in Weakened Random Oracle Models2008-03-05Paper
PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity2007-09-07Paper
Multi-bit Cryptosystems Based on Lattice Problems2007-09-04Paper
Notch effect on fatigue strength reduction of bearing steel in the very high cycle regime2006-10-27Paper
Smart structure for suppression of mode I and II crack propagation in CFRP laminates by shape memory alloy TiNi actuator2006-10-10Paper
Mode II fatigue crack growth from delamination in unidirectional tape and satin-woven fabric laminates of high strength GFRP2006-10-10Paper
Fatigue damage evaluation in SiCp/2024 by X-ray diffraction method2006-10-10Paper
Information Security and Privacy2006-06-22Paper
Public Key Cryptography - PKC 20052005-12-07Paper
Quantum bit-commitment for small storage based on quantum one-way permutations2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q45367992002-10-07Paper
https://portal.mardi4nfdi.de/entity/Q45483252002-08-26Paper
An exponential gap with the removal of one negation gate2002-07-14Paper
An extension of Grover's quantum search algorithm2001-09-17Paper
https://portal.mardi4nfdi.de/entity/Q45039712001-02-04Paper
https://portal.mardi4nfdi.de/entity/Q45054012000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49378712000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q49351402000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q47054691999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q47036541999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47038491999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q42533611999-11-08Paper
Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine1999-06-10Paper
https://portal.mardi4nfdi.de/entity/Q42341081999-03-16Paper
On the Complexity of Negation-Limited Boolean Networks1998-09-20Paper
Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates1998-09-07Paper
Negation-limited circuit complexity of symmetric functions1997-02-27Paper
A Dislocation Model for Fatigue Crack Initiation1981-01-01Paper

Research outcomes over time

This page was built for person: Keisuke Tanaka