Demo Data from SIGIR 2026 / reviewers in the wild / expert
Eiichiro Fujisaki
dblp:07/7039
· DBLP profile ↗
23ranked-venue papers
12as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 23 · 12 first-author · 3 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
13 papers |
Cryptographic primitives and cryptanalysis · 79% Cryptographic protocols and secure computation · 21% |
Topics — the 18 heaviest of 19, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
1.0 | 5 | 2018 | All-But-Many Encryption · J. Cryptol. 2018 Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions · ASIACRYPT (1) 2016 All-But-Many Encryption - A New Framework for Fully-Equipped UC Commitments · ASIACRYPT (2) 2014 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures |
0.9 | 2 | 2025 | On the Limits of Non-interactive Blind Signatures · ASIACRYPT (8) 2025 How to Date Blind Signatures · ASIACRYPT 1996 |
Cryptographic primitives and cryptanalysis
leakage-resilient cryptography |
0.2 | 1 | 2016 | Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions · ASIACRYPT (1) 2016 |
Cryptographic protocols and secure computation › commitment schemes
universally composable commitment |
0.2 | 1 | 2014 | All-But-Many Encryption - A New Framework for Fully-Equipped UC Commitments · ASIACRYPT (2) 2014 |
Cryptographic protocols and secure computation › composable security
universally composable security |
0.2 | 1 | 2014 | All-But-Many Encryption - A New Framework for Fully-Equipped UC Commitments · ASIACRYPT (2) 2014 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
hybrid encryption |
0.2 | 2 | 2013 | Secure Integration of Asymmetric and Symmetric Encryption Schemes · J. Cryptol. 2013 Secure Integration of Asymmetric and Symmetric Encryption Schemes · CRYPTO 1999 |
Cryptographic protocols and secure computation
key exchange |
0.2 | 1 | 2013 | Secure Integration of Asymmetric and Symmetric Encryption Schemes · J. Cryptol. 2013 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
OAEP |
0.1 | 2 | 2004 | RSA-OAEP Is Secure under the RSA Assumption · J. Cryptol. 2004 RSA-OAEP Is Secure under the RSA Assumption · CRYPTO 2001 |
Cryptographic primitives and cryptanalysis
encryption |
0.1 | 2 | 2001 | RSA-OAEP Is Secure under the RSA Assumption · CRYPTO 2001 Secure Integration of Asymmetric and Symmetric Encryption Schemes · CRYPTO 1999 |
Cryptographic protocols and secure computation
commitment schemes |
0.0 | 1 | 2002 | A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order · ASIACRYPT 2002 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.0 | 2 | 1996 | How to Date Blind Signatures · ASIACRYPT 1996 An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn · CRYPTO 1992 |
Cryptographic protocols and secure computation › secret sharing › verifiable secret sharing
publicly verifiable secret sharing |
0.0 | 1 | 1998 | A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications · EUROCRYPT 1998 |
Cryptographic protocols and secure computation
secret sharing |
0.0 | 1 | 1998 | A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications · EUROCRYPT 1998 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
statistical zero-knowledge |
0.0 | 1 | 1997 | Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations · CRYPTO 1997 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.0 | 1 | 1997 | Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations · CRYPTO 1997 |
Cryptographic primitives and cryptanalysis › cryptographic assumptions
groups of unknown order |
0.0 | 1 | 2002 | A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order · ASIACRYPT 2002 |
Cryptographic primitives and cryptanalysis
cryptographic assumptions |
0.0 | 1 | 2001 | RSA-OAEP Is Secure under the RSA Assumption · CRYPTO 2001 |
Cryptographic primitives and cryptanalysis › cryptographic assumptions
RSA assumption |
0.0 | 1 | 2001 | RSA-OAEP Is Secure under the RSA Assumption · CRYPTO 2001 |
Methods — techniques the papers use, named apart from their topics
tag-based encryption · 0.3lossy encryption · 0.3chosen-ciphertext security · 0.2KEM/DEM · 0.2random oracle model · 0.0RSA assumption · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | On the Limits of Non-interactive Blind Signatures
Kazuki Yamamura, Tetsuya Okuda, Eiichiro Fujisaki, Masayuki Abe |
ASIACRYPT (8) | 3 |
| 2025 | On Non-Interactive Blind Signatures in the Plain Model Using Complexity Leveraging
Kazuki Yamamura, Tetsuya Okuda, Eiichiro Fujisaki |
FC (2) | 3 |
| 2023 | Improved lattice enumeration algorithms by primal and dual reordering methodsabstractAbstract The security of lattice‐based cryptosystems is generally based on the hardness of the Shortest Vector Problem (SVP). The original enumeration (ENUM) algorithm solving SVP runs in exponential time due to the exhaustive search, which is used as a subroutine for the block Korkin–Zolotarev (BKZ) algorithm. It is a critical issue to reduce the computational complexity of ENUM. In this paper, first, we improve the reordering method proposed by Wang et al. in ACISP 2018. We call our proposed method DPR, which permutates the projected dual lattice vectors by decreasing norms. Preliminary experimental results show that the proposed reordering methods can reduce the ENUM complexity compared to the predecessor; for instance, DPR reduces around 32.8% on average in 45‐dimensional lattices. Moreover, the authors’ simulation shows that the higher the lattice dimension, the more DPR can reduce the ENUM complexity. In addition, we study a condition for deciding when the reordering method shall be executed or not. Finally, we improve the BKZ algorithm with DPR methods and the proposed condition. Kazuki Yamamura, Yuntao Wang 0002, Eiichiro Fujisaki |
IET Inf. Secur. | 3 |
| 2018 | All-But-Many Encryption
Eiichiro Fujisaki |
J. Cryptol. | 1 |
| 2017 | A Constant-Size Signature Scheme with Tighter Reduction from CDH Assumption
Kaisei Kajita, Kazuto Ogawa, Eiichiro Fujisaki |
ISC | 3 |
| 2016 | Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
Eiichiro Fujisaki, Keita Xagawa |
ASIACRYPT (1) | 1 |
| 2014 | All-But-Many Encryption - A New Framework for Fully-Equipped UC Commitments
Eiichiro Fujisaki |
ASIACRYPT (2) | 1 |
| 2013 | Secure Integration of Asymmetric and Symmetric Encryption Schemes
Eiichiro Fujisaki, Tatsuaki Okamoto |
J. Cryptol. | 1 |
| 2012 | New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications
Eiichiro Fujisaki |
CT-RSA | 1 |
| 2011 | Sub-linear Size Traceable Ring Signatures without Random Oracles
Eiichiro Fujisaki |
CT-RSA | 1 |
| 2010 | A Multi-trapdoor Commitment Scheme from the RSA Assumption
Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka |
ACISP | 2 |
| 2009 | On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions
Eiichiro Fujisaki, Ryo Nishimaki, Keisuke Tanaka |
ProvSec | 1 |
| 2009 | Efficient Non-interactive Universally Composable String-Commitment Schemes
Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka |
ProvSec | 2 |
| 2007 | Formal Security Treatments for Signatures from Identity-Based Encryption
Yang Cui 0001, Eiichiro Fujisaki, Goichiro Hanaoka, Hideki Imai, Rui Zhang 0002 |
ProvSec | 2 |
| 2006 | Forward-Secure Authenticated-Encryption in Multi-Receiver Setting
Kan Yasuda, Kazumaro Aoki, Eiichiro Fujisaki, Atsushi Fujioka |
SECRYPT | 3 |
| 2004 | RSA-OAEP Is Secure under the RSA Assumption
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern |
J. Cryptol. | 1 |
| 2002 | A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
Ivan Damgård, Eiichiro Fujisaki |
ASIACRYPT | 2 |
| 2001 | RSA-OAEP Is Secure under the RSA Assumption
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern |
CRYPTO | 1 |
| 1999 | Secure Integration of Asymmetric and Symmetric Encryption Schemes
Eiichiro Fujisaki, Tatsuaki Okamoto |
CRYPTO | 1 |
| 1998 | A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications
Eiichiro Fujisaki, Tatsuaki Okamoto |
EUROCRYPT | 1 |
| 1997 | Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
Eiichiro Fujisaki, Tatsuaki Okamoto |
CRYPTO | 1 |
| 1996 | How to Date Blind Signatures
Masayuki Abe, Eiichiro Fujisaki |
ASIACRYPT | 2 |
| 1992 | An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn
Tatsuaki Okamoto, Atsushi Fujioka, Eiichiro Fujisaki |
CRYPTO | 3 |