Hisayoshi Sato

According to our database1, Hisayoshi Sato authored at least 18 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fully Secure Searchable Encryption from PRFs, Pairings, and Lattices.
IACR Cryptol. ePrint Arch., 2024

2020
Practical Query-based Order Revealing Encryption from Symmetric Searchable Encryption.
Proceedings of the 15th Asia Joint Conference on Information Security, 2020

2019
Definition and Efficient Construction of Encrypted k-anonymization Scheme.
Proceedings of the 5th International Conference on Information Systems Security and Privacy, 2019

2018
Decentralized Netting Protocol over Consortium Blockchain.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
Auditable Zerocoin.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy Workshops, 2017

2016
On tameness of Matsumoto-Imai central maps in three variables over the finite field 픽<sub>2</sub>.
Adv. Math. Commun., 2016

2014
Some properties of $τ$-adic expansions on hyperelliptic Koblitz curves.
CoRR, 2014

Incrementally Executable Signcryptions.
Proceedings of the Information Security and Privacy - 19th Australasian Conference, 2014

2013
How to Evaluate Contents Popularity over Oblivious Transfer.
Proceedings of the Ninth International Conference on Signal-Image Technology & Internet-Based Systems, 2013

2012
Symmetric Inner-Product Predicate Encryption Based on Three Groups.
Proceedings of the Provable Security - 6th International Conference, 2012

Upper bound of the shortest vector coefficients and its applications.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Batch Verification Suitable for Efficiently Verifying a Limited Number of Signatures.
Proceedings of the Information Security and Cryptology - ICISC 2012, 2012

2011
Symmetric Searchable Encryption for Database Applications.
Proceedings of the 14th International Conference on Network-Based Information Systems, 2011

2010
Efficient arithmetic on subfield elliptic curves over small finite fields of odd characteristic.
J. Math. Cryptol., 2010

2006
Generalized Powering Functions and Their Application to Digital Signatures.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005
Efficient Arithmetic on Subfield Elliptic Curves over Small Odd Characteristics.
IACR Cryptol. ePrint Arch., 2005

2004
Exact Analysis of Montgomery Multiplication.
Proceedings of the Progress in Cryptology, 2004

2001
Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring.
Proceedings of the Information Security and Cryptology, 2001


  Loading...