Takeshi Koshiba

IEEE/ACM Trans. Netw., February, 2024

2023

Computing the quantumguesswork: a quadratic assignment problem.

[BibT_eX]

[DOI]

Michele Dall'Arno

Francesco Buscemi

Quantum Inf. Comput., July, 2023

A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm.

[BibT_eX]

[DOI]

Khodakhast Bibak

J. Inf. Secur. Appl., March, 2023

2022

Guesswork of a Quantum Ensemble.

[BibT_eX]

[DOI]

Michele Dall'Arno

Francesco Buscemi

IEEE Trans. Inf. Theory, 2022

Quantum verifiable protocol for secure modulo zero-sum randomness.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2022

Perfectly Secure Message Transmission Against Rational Adversaries.

[BibT_eX]

[DOI]

Maiki Fujita

Kenji Yasunaga

IEEE J. Sel. Areas Inf. Theory, 2022

From Random Numbers to Random Objects.

[BibT_eX]

[DOI]

Khodakhast Bibak

Entropy, 2022

The Odyssey of Entropy: Cryptography.

[BibT_eX]

[DOI]

Khodakhast Bibak

Entropy, 2022

Bangla-BERT: Transformer-Based Efficient Model for Transfer Learning and Language Understanding.

[BibT_eX]

[DOI]

Md. Kowsher

Abdullah As Sami

Nusrat Jahan Prottasha

Mohammad Shamsul Arefin

Syed Mohammad Minhaz Hossain

IEEE Access, 2022

CARAN: A Context-Aware Recency-Based Attention Network for Point-of-Interest Recommendation.

[BibT_eX]

[DOI]

Md. Billal Hossain

Mohammad Shamsul Arefin

IEEE Access, 2022

2021

Plant Leaf Disease Recognition Using Depth-Wise Separable Convolution-Based Models.

[BibT_eX]

[DOI]

Kaushik Deb

Symmetry, 2021

CricShotClassify: An Approach to Classifying Batting Shots from Cricket Videos Using a Convolutional Neural Network and Gated Recurrent Unit.

[BibT_eX]

[DOI]

Sensors, 2021

Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis.

[BibT_eX]

[DOI]

Entropy, 2021

Classification of Indoor Human Fall Events Using Deep Learning.

[BibT_eX]

[DOI]

Entropy, 2021

Image Defogging Framework Using Segmentation and the Dark Channel Prior.

[BibT_eX]

[DOI]

Sabiha Anan

Mohammad Ibrahim Khan

Entropy, 2021

Content Delivery Networks: State of the Art, Trends, and Future Roadmap.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2021

Efficient Private Conjunctive Query Protocol Over Encrypted Data.

[BibT_eX]

[DOI]

Cryptogr., 2021

Classical computation of quantum guesswork.

[BibT_eX]

[DOI]

Michele Dall'Arno

Francesco Buscemi

CoRR, 2021

Frequent contiguous pattern mining over biological sequences of protein misfolded diseases.

[BibT_eX]

[DOI]

Mohammad Shahedul Islam

Md. Abul Kashem Mia

Mohammad Shamsur Rahman

Mohammad Shamsul Arefin

BMC Bioinform., 2021

2020

Blind Audio Watermarking Based on Parametric Slant-Hadamard Transform and Hessenberg Decomposition.

[BibT_eX]

[DOI]

Azizul Hakim Chowdhury

Symmetry, 2020

Blind Image Watermarking in Canonical and Cepstrum Domains Based on 4-Connected t-o'clock Scrambling.

[BibT_eX]

[DOI]

Farhana Shirin Chowdhury

Kaushik Deb

Symmetry, 2020

Efficient protocols for private wildcards pattern matching.

[BibT_eX]

[DOI]

Deevashwer Rathee

J. Inf. Secur. Appl., 2020

Combined interactive protocol for lattice-based group signature schemes with verifier-local revocation.

[BibT_eX]

[DOI]

Int. J. Grid Util. Comput., 2020

Generalized M<sub>m, r</sub>-Network: A Case for Fixed Message Dimensions.

[BibT_eX]

[DOI]

Vikrant Singh

Chunduri Venkata Dheeraj Kumar

IEEE Commun. Lett., 2020

Almost Fully Secured Lattice-Based Group Signatures with Verifier-Local Revocation.

[BibT_eX]

[DOI]

Cryptogr., 2020

Enhanced Secure Comparison Schemes Using Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Networked-Based Information Systems, 2020

Fourier-based Verifiable Function Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019

Arbitrable blind quantum computation.

[BibT_eX]

[DOI]

Go Sato

Tomoyuki Morimae

Quantum Inf. Process., 2019

Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client.

[BibT_eX]

[DOI]

Tomoyuki Morimae

Quantum Inf. Comput., 2019

Efficient private database queries using ring-LWE somewhat homomorphic encryption.

[BibT_eX]

[DOI]

Mayank Rathee

J. Inf. Secur. Appl., 2019

Verifiable Quantum Secure Modulo Summation.

[BibT_eX]

[DOI]

CoRR, 2019

A Guests Managing System with Lattice-Based Verifier-Local Revocation Group Signature Scheme with Time-Bound Keys.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Mathematics and Computing, 2019

Perfectly Secure Message Transmission Against Independent Rational Adversaries.

[BibT_eX]

[DOI]

Kenji Yasunaga

Proceedings of the Decision and Game Theory for Security - 10th International Conference, 2019

2018

Achieving Strong Security and Member Registration for Lattice-based Group Signature Scheme with Verifier-local Revocation.

[BibT_eX]

[DOI]

J. Internet Serv. Inf. Secur., 2018

Outsourcing private equality tests to the cloud.

[BibT_eX]

[DOI]

J. Inf. Secur. Appl., 2018

Non-transferable proxy re-encryption for multiple groups.

[BibT_eX]

[DOI]

Lwin San

Int. J. Space Based Situated Comput., 2018

Secure Modulo Zero-Sum Randomness as Cryptographic Resource.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Achieving Strong Security and Verifier-Local Revocation for Dynamic Group Signatures from Lattice Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Security and Trust Management - 14th International Workshop, 2018

Zero-Knowledge Proof for Lattice-Based Group Signature Schemes with Verifier-Local Revocation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Network-Based Information Systems, 2018

Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation.

[BibT_eX]

[DOI]

Proceedings of the Information Security Practice and Experience, 2018

Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Almost-Fully Secured Fully Dynamic Group Signatures with Efficient Verifier-Local Revocation and Time-Bound Keys.

[BibT_eX]

[DOI]

Proceedings of the Internet and Distributed Computing Systems, 2018

New Assumptions on Isogenous Pairing Groups with Applications to Attribute-Based Encryption.

[BibT_eX]

[DOI]

Katsuyuki Takashima

Proceedings of the Information Security and Cryptology - ICISC 2018, 2018

Achieving Full Security for Lattice-Based Group Signatures with Verifier-Local Revocation.

[BibT_eX]

[DOI]

Proceedings of the Information and Communications Security - 20th International Conference, 2018

Perfectly Secure Message Transmission Against Rational Timid Adversaries.

[BibT_eX]

[DOI]

Maiki Fujita

Kenji Yasunaga

Proceedings of the Decision and Game Theory for Security - 9th International Conference, 2018

2017

Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2017

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2017

Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Perfectly Secure Message Transmission Scheme against Rational Adversaries.

[BibT_eX]

[DOI]

Maiki Fujita

IACR Cryptol. ePrint Arch., 2017

Fourier-based Function Secret Sharing with General Access Structure.

[BibT_eX]

[DOI]

CoRR, 2017

Non-Malleable Codes Against Affine Errors.

[BibT_eX]

[DOI]

Ryota Iwamoto

CoRR, 2017

An Efficient Privacy-Preserving Comparison Protocol.

[BibT_eX]

[DOI]

Proceedings of the Advances in Network-Based Information Systems, 2017

Function Secret Sharing Using Fourier Basis.

[BibT_eX]

[DOI]

Takuya Ohsawa

Naruhiro Kurokawa

Proceedings of the Advances in Network-Based Information Systems, 2017

Secure Non-transferable Proxy Re-encryption for Group Membership and Non-membership.

[BibT_eX]

[DOI]

Lwin San

Proceedings of the Advances in Network-Based Information Systems, 2017

Secure SMS Transmission Based on Verifiable Hash Convergent Group Signcryption.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE International Conference on Mobile Data Management, 2017

Private Comparison Protocol and Its Application to Range Queries.

[BibT_eX]

[DOI]

Proceedings of the Internet and Distributed Computing Systems, 2017

Privacy-Preserving Equality Test Towards Big Data.

[BibT_eX]

[DOI]

Proceedings of the Foundations and Practice of Security - 10th International Symposium, 2017

Efficient Protocols for Private Database Queries.

[BibT_eX]

[DOI]

Mayank

Proceedings of the Data and Applications Security and Privacy XXXI, 2017

Big Data Cloud Deduplication Based on Verifiable Hash Convergent Group Signcryption.

[BibT_eX]

[DOI]

Proceedings of the Third IEEE International Conference on Big Data Computing Service and Applications, 2017

Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Advanced Information Networking and Applications, 2017

Secure Deduplication in a Multiple Group Signature Setting.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Advanced Information Networking and Applications, 2017

Private Conjunctive Query over Encrypted Data.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - AFRICACRYPT 2017, 2017

2016

Pairing Cryptography Meets Isogeny: A New Framework of Isogenous Pairing Groups.

[BibT_eX]

[DOI]

Katsuyuki Takashima

IACR Cryptol. ePrint Arch., 2016

An Enhancement of Privacy-Preserving Wildcards Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

2015

New packing method in somewhat homomorphic encryption and its applications.

[BibT_eX]

[DOI]

Secur. Commun. Networks, 2015

Privacy-Preserving Fuzzy Commitment for Biometrics via Layered Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the Foundations and Practice of Security - 8th International Symposium, 2015

Secure Data Devolution: Practical Re-encryption with Auxiliary Data in LWE-based Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015

Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014

On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2014

Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets.

[BibT_eX]

[DOI]

CoRR, 2014

Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 19th Australasian Conference, 2014

2013

Practical Packing Method in Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2013

Secure pattern matching using somewhat homomorphic encryption.

[BibT_eX]

[DOI]

Proceedings of the CCSW'13, 2013

Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics.

[BibT_eX]

[DOI]

Proceedings of the Security Engineering and Intelligence Informatics, 2013

2012

Quantum Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Natural Computing, 2012

Computational Indistinguishability Between Quantum States and Its Cryptographic Application.

[BibT_eX]

[DOI]

J. Cryptol., 2012

2010

Public Discussion Must Be Back and Forth in Secure Message Transmission.

[BibT_eX]

[DOI]

Shinya Sawada

Proceedings of the Information Security and Cryptology - ICISC 2010, 2010

2009

Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function.

[BibT_eX]

[DOI]

Takanori Odaira

Proceedings of the Theory of Quantum Computation, 2009

Strengthening the Security of Distributed Oblivious Transfer.

[BibT_eX]

[DOI]

Kai-Yuen Cheong

Shohei Nishiyama

Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

2008

A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions.

[BibT_eX]

[DOI]

Wataru Kishimoto

IEEE Trans. Inf. Theory, 2008

Reducing Complexity Assumptions for Oblivious Transfer.

[BibT_eX]

[DOI]

Kai-Yuen Cheong

IACR Cryptol. ePrint Arch., 2008

Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, Third International Conference, 2008

2007

More on Security of Public-Key Cryptosystems Based on Chebyshev Polynomials.

[BibT_eX]

[DOI]

Kai-Yuen Cheong

IEEE Trans. Circuits Syst. II Express Briefs, 2007

How to Derive Lower Bound on Oblivious Transfer Reduction.

[BibT_eX]

[DOI]

Wataru Kishimoto

IACR Cryptol. ePrint Arch., 2007

Direct Reduction of String (1, 2)-OT to Rabin's OT.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Low-density attack revisited.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2007

2006

Progress in Quantum Computational Cryptography.

[BibT_eX]

[DOI]

Akinori Kawachi

J. Univers. Comput. Sci., 2006

Round-Efficient One-Way Permutation Based Perfectly Concealing Bit Commitment Scheme.

[BibT_eX]

[DOI]

Yoshiharu Seri

Electron. Colloquium Comput. Complex., 2006

2005

Universal test for quantum one-way permutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

Theoretical Analysis of chi<sup>2</sup> Attack on RC6.

[BibT_eX]

[DOI]

Masahiko Takenaka

Takeshi Shimoyama

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2004

Short Exponent Diffie-Hellman Problems.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2004

2002

Theoretical Analysis of "Correlations in RC6".

[BibT_eX]

[DOI]

Masahiko Takenaka

Takeshi Shimoyama

IACR Cryptol. ePrint Arch., 2002

On Sufficient Randomness for Secure Public-Key Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2002

Multiple Linear Cryptanalysis of a Reduced Round RC6.

[BibT_eX]

[DOI]

Takeshi Shimoyama

Masahiko Takenaka

Proceedings of the Fast Software Encryption, 9th International Workshop, 2002

2001

A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2001

Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Inferring pure context-free languages from positive data.

[BibT_eX]

[DOI]

Erkki Mäkinen

Yuji Takada

Acta Cybern., 2000

A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples.

[BibT_eX]

Kunihiko Hiraishi

Proceedings of the International Colloquium on Words, 2000

1999

A Technique for Boosting the Security of Cryptographic Systems with One-Way Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 1999

1998

Enhancing D-ABDUCTOR towards a diagrammatic user interface platform.

[BibT_eX]

[DOI]

Proceedings of the Knowledge-Based Intelligent Electronic Systems, 1998

1997

Learning Deterministic even Linear Languages From Positive Examples.

[BibT_eX]

[DOI]

Erkki Mäkinen

Yuji Takada

Theor. Comput. Sci., 1997

On a Hierarchy of Slender Languages Based on Control Sets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Computational learning theoretic cryptanalysis of language theoretic cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Security, First International Conference, 1997

1996

A machine learning approach to knowledge acquisitions from text databases.

[BibT_eX]

[DOI]

Yasubumi Sakakibara

Kazuo Misue

Int. J. Hum. Comput. Interact., 1996

Decision Tree Learning Systems with Switching Evaluators.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 1996

1995

Typed pattern languages and their learnability.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, Second European Conference, 1995

Learning Strongly Deterministic Even Linear Languages from Positive Examples.

[BibT_eX]

[DOI]