Koji Nuida

Applied Filters

Koji Nuida
AuthorRemove filter

Clear all

People

Colleagues

Koji Nuida (52)
Goichiro Hanaoka (12)
Reo Eriguchi (8)
Kazumasa Shinagawa (6)
Kazuto Ogawa (6)
Satsuya Ohata (6)
Hajime Watanabe (5)
Hideki Imai (5)
Manabu Hagiwara (5)
Satoshi Fujitsu (4)
Shota Yamada (4)
Takashi Kitagawa (4)
Eiji Okamoto (3)
Hiraku Morita (3)
Kana Shimizu (3)
Keitaro Hiwatashi (3)
Noboru Kunihiro (3)
Nuttapong Attrapadung (3)
Takashi Nishide (3)
Takaaki Mizuki (2)

Publication

Journal/Magazine Names

Designs, Codes and Cryptography (4)
Discrete Mathematics (1)
IEEE Transactions on Dependable and Secure Computing (1)
IEEE Transactions on Information Theory (1)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (1)
International Journal of Information Security (1)
Journal of Combinatorial Theory Series A (1)

Proceedings/Book Names

ICITS'09: Proceedings of the 4th international conference on Information theoretic security (3)
2018 International Symposium on Information Theory and Its Applications (ISITA) (2)
Advances in Information and Computer Security (2)
IWSEC 2015: Proceedings of the 10th International Workshop on Advances in Information and Computer Security - Volume 9241 (2)
Advances in Cryptology – ASIACRYPT 2021 (1)
Advances in Cryptology – CRYPTO 2021 (1)
Advances in Information and Computer Security (1)
Advances in Information and Computer Security (1)
Applied Cryptography and Network Security (1)
Applied Cryptography and Network Security (1)
Computer Algebra in Scientific Computing (1)
Computer Security – ESORICS 2023 (1)
Financial Cryptography and Data Security (1)
HCI for Cybersecurity, Privacy and Trust (1)
Information Security and Privacy (1)
Information Security Practice and Experience (1)
Network and System Security (1)
Provable and Practical Security (1)
Public-Key Cryptography – PKC 2021 (1)
Theory of Cryptography (1)

All Publications

Proceedings (41)
Other periodicals (9)
Books (1)
Journals (1)

Publisher

Springer-Verlag (38)
Kluwer Academic Publishers (4)
IEEE Press (3)
Association for Computing Machinery (2)
IEEE Computer Society Press (2)
Academic Press, Inc. (1)
Elsevier Science Publishers B. V. (1)
IEEE Computer Society (1)

Publication Date

Upon changing this filter the page will automatically refresh

Past 5 years
Past 2 years
Past year

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

52 Results for: Author: Koji NuidaEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,767,219 records)|Limit your search to The ACM Full-Text Collection (760,013 records)

Results

Showing 1 - 20of52 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

Article
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search
- Reo Eriguchi
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Kaoru Kurosawa
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  https://ror.org/03qvqb743Research and Development Initiative, Chuo University, Tokyo, Japan
  ,
- Koji Nuida
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  https://ror.org/00p4k0j84Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan
Advances in Cryptology – EUROCRYPT 2024•May 2024, pp 92-121• https://doi.org/10.1007/978-3-031-58740-5_4
Abstract
Motivated by secure database search, we present secure computation protocols for a function f in the client-servers setting, where a client can obtain f(x) on a private input x by communicating with multiple servers each holding f. Specifically, ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions
- Kazumasa Shinagawa
  https://ror.org/00sjd5653Ibaraki University, Hitachi, Japan
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
  ,
- Koji Nuida
  https://ror.org/00p4k0j84Institute of Mathematics for Industry (IMI), Kyushu University, Fukuoka, Japan
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Progress in Cryptology – INDOCRYPT 2023•December 2023, pp 45-61• https://doi.org/10.1007/978-3-031-56235-8_3
Abstract
Private Simultaneous Messages (PSM) is a minimal model of secure computation, where the input players with shared randomness send messages to the output player simultaneously and only once. In this field, finding upper and lower bounds on ... $_{}$ $_{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Threshold Fully Homomorphic Encryption Over the Torus
- Yukimasa Sugizaki
  NEC Corporation, Kanagawa, Japan
  ,
- Hikaru Tsuchida
  NEC Corporation, Kanagawa, Japan
  ,
- Takuya Hayashi
  NEC Corporation, Kanagawa, Japan
  ,
- Koji Nuida
  https://ror.org/00p4k0j84Kyushu University, Fukuoka, Japan
  ,
- Akira Nakashima
  NEC Corporation, Kanagawa, Japan
  ,
- Toshiyuki Isshiki
  NEC Corporation, Kanagawa, Japan
  ,
- Kengo Mori
  NEC Corporation, Kanagawa, Japan
Computer Security – ESORICS 2023•September 2023, pp 45-65• https://doi.org/10.1007/978-3-031-50594-2_3
Abstract
Fully homomorphic encryption (FHE) enables arithmetic operations to be performed over plaintext by operations on undecrypted ciphertext. The Chillotti-Gama-Georgieva-Izabachene (CGGI) scheme is a typical FHE scheme, has attracted attention because ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Efficient Card-Based Millionaires’ Protocols via Non-binary Input Encoding
- Koji Nuida
  Institute of Mathematics for Industry (IMI), Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Advances in Information and Computer Security•August 2023, pp 237-254• https://doi.org/10.1007/978-3-031-41326-1_13
Abstract
Comparison of integers, a traditional topic in secure multiparty computation since Yao’s pioneering work on “Millionaires’ Problem” (FOCS 1982), is also well studied in card-based cryptography. For the problem, Miyahara et al. (Theoretical ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Private simultaneous messages based on quadratic residues
- Kazumasa Shinagawa
  https://ror.org/00sjd5653Ibaraki University, 4-12-1 Nakanarusawa, 316-8511, Hitachi, Ibaraki, Japan
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology (AIST), 2-3-26 Aomi, 135-0064, Koto, Tokyo, Japan
  ,
- Reo Eriguchi
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology (AIST), 2-3-26 Aomi, 135-0064, Koto, Tokyo, Japan
  ,
- Shohei Satake
  https://ror.org/02cgss904Kumamoto University, 2-39-1 Kurokami, 860-8555, Chuo, Kumamoto, Japan
  ,
- Koji Nuida
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology (AIST), 2-3-26 Aomi, 135-0064, Koto, Tokyo, Japan
  https://ror.org/00p4k0j84Institute of Mathematics for Industry (IMI), Kyushu University, 744 Motooka, 819-0395, Nishi, Fukuoka, Japan
Designs, Codes and Cryptography, Volume 91, Issue 12•Dec 2023, pp 3915-3932 • https://doi.org/10.1007/s10623-023-01279-5
Abstract
Private Simultaneous Messages (PSM) model is a minimal model for secure multiparty computation. Feige, Kilian, and Naor (STOC 1994) and Ishai (Cryptology and Information Security Series 2013) constructed PSM protocols based on quadratic residues. ... $^{}$ $^{}$ $^{}$ $_{}$ $^{}^{}$ ${\sqrt{}}^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Explicit and Nearly Tight Lower Bound for 2-Party Perfectly Secure FSS
- Keitaro Hiwatashi
  https://ror.org/057zh3y96Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Koji Nuida
  https://ror.org/00p4k0j84Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan
  https://ror.org/01703db54National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
Applied Cryptography and Network Security•June 2023, pp 541-554• https://doi.org/10.1007/978-3-031-33491-7_20
Abstract
Function Secret Sharing (FSS) is a cryptographic tool introduced by Boyle et al. (EUROCRYPT 2015) and is useful for several applications such as private information retrieval, oblivious-RAM, multi-party computation, etc. Most of the known FSS ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- Koji Nuida
  Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST); Akihabara-Daibiru Room 1102, 1-18-13 Sotokanda, Chiyoda-ku, Tokyo 101-0021, Japan
  ,
- Satoshi Fujitsu
  Science & Technical Research Laboratories, Japan Broadcasting Corporation (NHK); 1-10-11 Kinuta, Setagaya-ku, Tokyo 157-8510, Japan
  ,
- Manabu Hagiwara
  Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST); Akihabara-Daibiru Room 1102, 1-18-13 Sotokanda, Chiyoda-ku, Tokyo 101-0021, Japan
  ,
- Takashi Kitagawa
  Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST); Akihabara-Daibiru Room 1102, 1-18-13 Sotokanda, Chiyoda-ku, Tokyo 101-0021, Japan
  ,
- Hajime Watanabe
  Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST); Akihabara-Daibiru Room 1102, 1-18-13 Sotokanda, Chiyoda-ku, Tokyo 101-0021, Japan
  ,
- Kazuto Ogawa
  Science & Technical Research Laboratories, Japan Broadcasting Corporation (NHK); 1-10-11 Kinuta, Setagaya-ku, Tokyo 157-8510, Japan
  ,
- Hideki Imai
  Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST); Akihabara-Daibiru Room 1102, 1-18-13 Sotokanda, Chiyoda-ku, Tokyo 101-0021, Japan
  Faculty of Science and Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes•December 2007, pp 80-89• https://doi.org/10.1007/978-3-540-77224-8_12
Abstract
The code length of Tardos’s collusion-secure fingerprinting code (STOC’03) is of theoretically minimal order with respect to the number of malicious users (pirates); however, the constant factor should be further reduced for practical ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Public Access
Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- Reo Eriguchi
  The University of Tokyo, Tokyo, Japan
  National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
  ,
- Noboru Kunihiro
  University of Tsukuba, Ibaraki, Japan
  ,
- Koji Nuida
  Kyushu University, Fukuoka, Japan
Designs, Codes and Cryptography, Volume 91, Issue 5•May 2023, pp 1751-1778 • https://doi.org/10.1007/s10623-022-01177-2
Abstract
d-Multiplicative secret sharing enables n players to locally compute additive shares of the product of d secrets from their shares. Barkol et al. (Journal of Cryptology, 2010) show that it is possible to construct a d-multiplicative scheme for any ... $_{}$ $_{}$ $_{}$ $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
On the Optimal Communication Complexity of Error-Correcting Multi-server PIR
- Reo Eriguchi
  Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Kaoru Kurosawa
  Research and Development Initiative, Chuo University, Tokyo, Japan
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Koji Nuida
  Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
Theory of Cryptography•November 2022, pp 60-88• https://doi.org/10.1007/978-3-031-22368-6_3
Abstract
An $ℓ$ -server Private Information Retrieval (PIR) scheme enables a client to retrieve a data item from a database replicated among $ℓ$ servers while hiding the identity of the item. It is called b-error-correcting if a client can correctly compute the ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
Efficient Noise Generation Protocols for Differentially Private Multiparty Computation
- Reo Eriguchi
  Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
  ,
- Atsunori Ichikawa
  NTT Social Informatics Laboratories, Tokyo, Japan
  ,
- Noboru Kunihiro
  Department of Computer Science, University of Tsukuba, Tsukuba, Ibaraki, Japan
  ,
- Koji Nuida
  Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan
IEEE Transactions on Dependable and Secure Computing, Volume 20, Issue 6•Nov.-Dec. 2023, pp 4486-4501 • https://doi.org/10.1109/TDSC.2022.3227568
To bound information leakage in outputs of protocols, it is important to construct secure multiparty computation protocols which output differentially private values perturbed by the addition of noise. However, previous noise generation protocols have ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
Chosen Ciphertext Secure Keyed Two-Level Homomorphic Encryption
- Yusaku Maeda
  The University of Tokyo, Tokyo, Japan
  ,
- Koji Nuida
  Institute of Mathematics for Industry (IMI), Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Information Security and Privacy•November 2022, pp 209-228• https://doi.org/10.1007/978-3-031-22301-3_11
Abstract
Homomorphic encryption (HE) is a useful variant of public key encryption (PKE), but it has a drawback that HE cannot fully achieve IND-CCA2 security, a standard security notion for PKE. Emura et al. (PKC 2013) proposed a “keyed" version of HE, ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
- Nariyasu Heseri
  Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan
  ,
- Koji Nuida
  Institute of Mathematics for Industry (IMI), Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Advances in Information and Computer Security•August 2022, pp 208-223• https://doi.org/10.1007/978-3-031-15255-9_11
Abstract
Due to the fact that classical computers cannot efficiently obtain random numbers, it is common practice to design cryptosystems in terms of real random numbers and then replace them with cryptographically secure pseudorandom ones for concrete ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption
- Hirotomo Shinoki
  Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan
  ,
- Koji Nuida
  Institute of Mathematics for Industry (IMI), Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Advances in Information and Computer Security•August 2022, pp 189-207• https://doi.org/10.1007/978-3-031-15255-9_10
Abstract
Homomorphic encryption (HE) is public key encryption that enables computation over ciphertexts without decrypting them, while it is known that HE cannot achieve IND-CCA2 security. To overcome this issue, the notion of keyed-homomorphic encryption (...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
How to Handle Invalid Queries for Malicious-Private Protocols Based on Homomorphic Encryption
- Koji Nuida
  Kyushu University & National Institute of Advanced Industrial Science and Technology (AIST), Fukuoka, Japan
APKC '22: Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop•May 2022, pp 15-25• https://doi.org/10.1145/3494105.3526238

We consider a setting of two-party computation between a server and a client where every message received by the server is encrypted by a fully homomorphic encryption (FHE) scheme and its decryption key is held by the client only. Akavia and Vald (IACR ...
1Citation
57
Downloads
Metrics
Total Citations1
Total Downloads57
Last 12 Months12
Last 6 weeks2
1
Supplementary Material
APKC22-apkc01.mp4
Export Citations
Save to Binder
Get Access
Article
Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security
- Mriganka Mandal
  Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan
  ,
- Ramprasad Sarkar
  Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur, India
  ,
- Junbeom Hur
  Department of Computer Science and Engineering, Korea University, Seoul, Korea
  ,
- Koji Nuida
  Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
Information Security Practice and Experience•December 2021, pp 168-189• https://doi.org/10.1007/978-3-030-93206-0_11
Abstract
We aim to efficiently design a unified, cost-effective primitive exhibiting two mutually orthogonal functionalities, namely subscribed users anonymity and public-key traitor traceability in the context of Broadcast Encryption (BE), and propose an ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Parallel Evaluation of Low-Degree Polynomials
- Reo Eriguchi
  The University of Tokyo, Tokyo, Japan
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Koji Nuida
  Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
Advances in Cryptology – ASIACRYPT 2021•December 2021, pp 191-221• https://doi.org/10.1007/978-3-030-92075-3_7
Abstract
Homomorphic secret sharing (HSS) for a function f allows input parties to distribute shares for their private inputs and then locally compute output shares from which the value of f is recovered. HSS can be directly used to obtain a two-round ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
Article
Improved Supersingularity Testing of Elliptic Curves Using Legendre Form
- Yuji Hashimoto
  Graduate School of Information Science and Technology, The University of Tokyo, 7-3-1 Hongo, 113-8654, Bunkyo-ku, Tokyo, Japan
  National Institute of Advanced Industrial Science and Technology, 2-3-26 Aomi, 135-0064, Koto-ku, Tokyo, Japan
  ,
- Koji Nuida
  National Institute of Advanced Industrial Science and Technology, 2-3-26 Aomi, 135-0064, Koto-ku, Tokyo, Japan
  Institute of Mathematics for Industry (IMI), Kyushu University, 744 Motooka, 819-0395, Nishi-ku, Fukuoka, Japan
Computer Algebra in Scientific Computing•September 2021, pp 121-135• https://doi.org/10.1007/978-3-030-85165-1_8
Abstract
There are two types of elliptic curves, ordinary elliptic curves and supersingular elliptic curves. In 2012, Sutherland proposed an efficient and almost deterministic algorithm for determining whether a given curve is ordinary or supersingular. ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions
- Reo Eriguchi
  The University of Tokyo, Tokyo, Japan
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Kazuma Ohara
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Shota Yamada
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  ,
- Koji Nuida
  National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
  Kyushu University, Fukuoka, Japan
Advances in Cryptology – CRYPTO 2021•August 2021, pp 305-334• https://doi.org/10.1007/978-3-030-84245-1_11
Abstract
Non-interactive secure multiparty computation (NIMPC) is a variant of secure computation which allows each of n players to send only a single message depending on his input and correlated randomness. Abelian programs, which can realize any ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Accelerating Secure (2+1)-Party Computation by Insecure but Efficient Building Blocks
- Keitaro Hiwatashi
  The University of Tokyo & AIST, Tokyo, Japan
  ,
- Ken Ogura
  The University of Tokyo, Tokyo, Japan
  ,
- Satsuya Ohata
  Digital Garage, Inc., Tokyo, Japan
  ,
- Koji Nuida
  The University of Tokyo & AIST, Tokyo, Japan
ASIA CCS '21: Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security•May 2021, pp 616-627• https://doi.org/10.1145/3433210.3453109

Secure multi-party computation (MPC) is a cryptographic tool that enables a set of parties to compute a function jointly while keeping each input secret. Since MPC based on secret sharing (SS) achieves high throughput and works fast, many applications ...
2Citation
280
Downloads
Metrics
Total Citations2
Total Downloads280
Last 12 Months16
Last 6 weeks2
Export Citations
Save to Binder
Get Access
Article
Cryptographic Pseudorandom Generators Can Make Cryptosystems Problematic
- Koji Nuida
  Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan
  National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Public-Key Cryptography – PKC 2021•May 2021, pp 441-468• https://doi.org/10.1007/978-3-030-75248-4_16
Abstract
Randomness is an essential resource for cryptography. For practical randomness generation, the security notion of pseudorandom generators (PRGs) intends to automatically preserve (computational) security of cryptosystems when used in ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder

Author Profile Pages

Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples:
History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:
- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.

Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
Future Direction: The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.

A direct search interface for Author Profiles will be built.

An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.

It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.

Bibliometrics

The ACM DL is a comprehensive repository of publications from the entire field of computing.

It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.

Average citations per article = The total Citation Count divided by the total Publication Count.
Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)

ACM Author-Izer Service

Summary Description

ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.

Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.

ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.

To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.

How ACM Author-Izer Works

Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.

The Service can be applied to all the articles you have ever published with ACM.

Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.

For authors who do not have a free ACM Web Account:

Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.

For authors who have an ACM web account, but have not edited their ACM Author Profile page:

Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.

For authors who have an account and have already edited their Profile Page:

Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"

ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.

Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.

FAQ

Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
Q. What articles are eligible for ACM Author-Izer?
A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.

Q. Are there any restrictions on authors to use this service?
A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.

Q. What are the requirements to use this service?
A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.

Q. What is an ACM Author Profile Page?
A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.

Q. How do I find my Author Profile page and take ownership?
A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours

Q. Why does my photo not appear?
A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters

Q. What if I cannot find the Add Personal Information function on my author page?
A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.

Q. What happens if an author changes the location of his bibliography or moves to a new institution?
A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.

Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.

However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.

Q. What happens if the author’s bibliography lives on a page with several aliases?
A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.

Q. Why should authors use ACM Author-Izer?
A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.

Q. Does ACM Author-Izer provide benefits for authors?
A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.

Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.

Q. How does ACM Author-Izer benefit the computing community?
A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.

In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.

Q. How do authors access ACM Author-Izer?
A. See How to Use

Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.

Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner

Koji Nuida

Koji Nuida

Applied Filters

People

Colleagues

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search

Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions

Threshold Fully Homomorphic Encryption Over the Torus

Efficient Card-Based Millionaires’ Protocols via Non-binary Input Encoding

Private simultaneous messages based on quadratic residues

Explicit and Nearly Tight Lower Bound for 2-Party Perfectly Secure FSS

An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths

Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures

On the Optimal Communication Complexity of Error-Correcting Multi-server PIR

Efficient Noise Generation Protocols for Differentially Private Multiparty Computation

Chosen Ciphertext Secure Keyed Two-Level Homomorphic Encryption

Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols

On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption

How to Handle Invalid Queries for Malicious-Private Protocols Based on Homomorphic Encryption

Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security

Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Parallel Evaluation of Low-Degree Polynomials

Improved Supersingularity Testing of Elliptic Curves Using Legendre Form

Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions

Accelerating Secure (2+1)-Party Computation by Insecure but Efficient Building Blocks

Cryptographic Pseudorandom Generators Can Make Cryptosystems Problematic