Rafael Pass

Applied Filters

Rafael Pass
AuthorRemove filter

Clear all

People

Colleagues

Rafael Pass (150)
Joseph Halpern (18)
Huijia Lin (14)
Kaimin Chung (14)
Muthuramakrishnan Venkitasubramaniam (14)
Abhi Shelat (12)
E Shi (11)
Ilan Komargodski (10)
Cody Freitag (9)
Ran Canetti (9)
Alon Rosen (8)
Wei Lung Dustin Tseng (8)
Andrew Morgan (6)
Sidharth Telang (6)
Huijia Lin (5)
Vinod Vaikuntanathan (5)
Edward Lui (4)
Gilad Asharov (4)
Mohammad Mahmoody (4)
Silvio M Micali (4)

Roles

Editor
Other
Advisor

Publication

Journal/Magazine Names

SIAM Journal on Computing (7)
Journal of Cryptology (6)
ACM SIGACT News (2)
ACM Transactions on Economics and Computation (2)
Journal of the ACM (2)
ACM SIGecom Exchanges (1)
ACM Transactions on Computation Theory (1)
Algorithmica (1)
Communications of the ACM (1)
Computational Complexity (1)
Distributed Computing (1)
IEEE Security and Privacy (1)
International Journal of Game Theory (1)

Proceedings/Book Names

FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (4)
TCC'11: Proceedings of the 8th conference on Theory of cryptography (4)
ITCS '13: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (3)
Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417 (3)
TCC 2016-A: Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562 (3)
TCC'10: Proceedings of the 7th international conference on Theory of Cryptography (3)
Theory of Cryptography (3)
Advances in Cryptology – EUROCRYPT 2020 (2)
Advances in Cryptology – EUROCRYPT 2024 (2)
ASIACRYPT'07: Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security (2)
CRYPTO'05: Proceedings of the 25th annual international conference on Advances in Cryptology (2)
Financial Cryptography and Data Security (2)
ITCS '15: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (2)
Security and Cryptography for Networks (2)
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computing (2)
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing (2)
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2)
TARK '09: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2)
TCC'08: Proceedings of the 5th conference on Theory of cryptography (2)
Theory of Cryptography (2)

All Publications

Proceedings (121)
Other periodicals (18)
Journals (5)
Newsletters (3)
Books (1)
Doctoral Theses (1)
Magazines (1)

Content Type

Research Article (41)
Abstract (2)
Column (1)
Poster (1)

Media Formats

PDF (36)
HTML (4)
Image (4)
Fulltext (2)
Video (1)

Publisher

Springer-Verlag (77)
Association for Computing Machinery (37)
IEEE Computer Society (14)
AAAI Press (7)
Society for Industrial and Applied Mathematics (7)
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik (3)
Birkhauser Verlag (1)
IEEE Educational Activities Department (1)
Massachusetts Institute of Technology (1)
Morgan Kaufmann Publishers Inc. (1)
Physica-Verlag GmbH (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

150 Results for: Author: Rafael PassEdit 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,802,449 records)|Limit your search to The ACM Full-Text Collection (772,004 records)

Results

Showing 1 - 20of150 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
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
- Cody Freitag
  https://ror.org/04t5xt781Northeastern University, Boston, USA
  ,
- Omer Paneth
  https://ror.org/04mhzgx49Tel Aviv University, Tel Aviv, Israel
  ,
- Rafael Pass
  Tel Aviv University & Cornell Tech, Tel Aviv, Israel
Advances in Cryptology – EUROCRYPT 2024•May 2024, pp 112-141• https://doi.org/10.1007/978-3-031-58737-5_5
Abstract
Succinct arguments allow a powerful (yet polynomial-time) prover to convince a weak verifier of the validity of some NP statement using very little communication. A major barrier to the deployment of such proofs is the unwieldy overhead of the ... $\overset{}{}$ $\overset{}{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
A Direct PRF Construction from Kolmogorov Complexity
- Yanyi Liu
  Cornell Tech, New York, USA
  ,
- Rafael Pass
  Cornell Tech, New York, USA
  https://ror.org/04mhzgx49Tel-Aviv University, Tel Aviv, Israel
Advances in Cryptology – EUROCRYPT 2024•May 2024, pp 375-406• https://doi.org/10.1007/978-3-031-58737-5_14
Abstract
While classic results in the 1980s establish that one-way functions (OWF) imply the existence of pseudorandom generators (PRG) which in turn imply pseudorandom functions (PRF), the constructions (most notably the one from OWFs to PRGs) is ...
$^{}$ $^{}$ $^{}$
$^{}^{\sqrt{}}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Simplex Consensus: A Simple and Fast Consensus Protocol
- Benjamin Y. Chan
  Cornell Tech, New York, USA
  ,
- Rafael Pass
  Tel-Aviv University & Cornell Tech, Tel Aviv, Israel
Theory of Cryptography•November 2023, pp 452-479• https://doi.org/10.1007/978-3-031-48624-1_17
Abstract
We present a theoretical framework for analyzing the efficiency of consensus protocols, and apply it to analyze the optimistic and pessimistic confirmation times of state-of-the-art partially-synchronous protocols in the so-called “rotating leader/...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
On One-Way Functions and Sparse Languages
- Yanyi Liu
  Cornell Tech, New York, USA
  ,
- Rafael Pass
  Tel-Aviv University & Cornell Tech, Tel Aviv-Yafo, Israel
Theory of Cryptography•November 2023, pp 219-237• https://doi.org/10.1007/978-3-031-48615-9_8
Abstract
We show equivalence between the existence of one-way functions and the existence of a sparse language that is hard-on-average w.r.t. some efficiently samplable “high-entropy” distribution. In more detail, the following are equivalent:
The existence ...
$^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Counting Unpredictable Bits: A Simple PRG from One-Way Functions
- Noam Mazor
  Cornell Tech, New York, USA
  ,
- Rafael Pass
  Cornell Tech, New York, USA
  https://ror.org/04mhzgx49Tel-Aviv University, Tel Aviv, Israel
Theory of Cryptography•November 2023, pp 191-218• https://doi.org/10.1007/978-3-031-48615-9_7
Abstract
A central result in the theory of Cryptography, by Håstad, Imagliazzo, Luby and Levin [SICOMP’99], demonstrates that the existence one-way functions (OWF) implies the existence of pseudo-random generators (PRGs). Despite the fundamental importance ...
$^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Leakage-Resilient Hardness vs Randomness
- Yanyi Liu
  Cornell Tech, New York, NY, USA
  ,
- Rafael Pass
  Tel-Aviv University, Israel and Cornell Tech, New York, NY, USA
CCC '23: Proceedings of the conference on Proceedings of the 38th Computational Complexity Conference•July 2023, Article No.: 32, pp 1-20• https://doi.org/10.4230/LIPIcs.CCC.2023.32

A central open problem in complexity theory concerns the question of whether all efficient randomized algorithms can be simulated by efficient deterministic algorithms. The celebrated "hardness v.s. randomness" paradigm pioneered by Blum-Micali (SIAM ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Get Access
Article
One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions
- Yanyi Liu
  Cornell Tech, New York, USA
  ,
- Rafael Pass
  Tel-Aviv University & Cornell Tech, Tel Aviv, Israel
Advances in Cryptology – CRYPTO 2023•August 2023, pp 645-673• https://doi.org/10.1007/978-3-031-38545-2_21
Abstract
Consider the recently introduced notion of probabilistic time-bounded Kolmogorov Complexity, $p K^{t}$ (Goldberg et al., CCC’22), and let ${MpK}^{t} P$ denote the language of pairs (x, k) such that $p K^{t} (x) \leq k$ . We show the equivalence of the following:
MpKpolyP is (...
$^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
free
Published By ACM
Published By ACM
Toward Basing Cryptography on the Hardness of EXP
- Yanyi Liu
  Cornell Tech, New York, NY, USA
  ,
- Rafael Pass
  Cornell Tech, New York, NY, and Tel-Aviv University, Israel
Communications of the ACM, Volume 66, Issue 5•May 2023, pp 91-99 • https://doi.org/10.1145/3587167

Let Kt(x) denote the Levin-Kolmogorov Complexity of the string x, and let MKtP denote the language of pairs (x, k) having the property that Kt(x) ≤ k. We demonstrate that:

• MKtP ∉ Heur_negBPP (i.e., MKtP is two-sided error mildly average-case hard) iff ...
0Citation
780
Downloads
Metrics
Total Citations0
Total Downloads780
Last 12 Months584
Last 6 weeks132
Export Citations
Save to Binder
More
View online with eReader
Digital Edition
PDF
Article
Concurrently Composable Non-interactive Secure Computation
- Andrew Morgan
  Cornell University, Ithaca, USA
  ,
- Rafael Pass
  Cornell Tech, New York, USA
Advances in Cryptology – ASIACRYPT 2022•December 2022, pp 526-555• https://doi.org/10.1007/978-3-031-22963-3_18
Abstract
We consider the feasibility of non-interactive secure two-party computation (NISC) in the plain model satisfying the notion of superpolynomial-time simulation (SPS). While stand-alone secure SPS-NISC protocols are known from standard assumptions (...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Universal Reductions: Reductions Relative to Stateful Oracles
- Benjamin Chan
  Cornell Tech, New York, USA
  ,
- Cody Freitag
  Cornell Tech, New York, USA
  ,
- Rafael Pass
  Cornell Tech, New York, USA
  Tel-Aviv University, Tel Aviv-Yafo, Israel
Theory of Cryptography•November 2022, pp 151-180• https://doi.org/10.1007/978-3-031-22368-6_6
Abstract
We define a framework for analyzing the security of cryptographic protocols that makes minimal assumptions about what a “realistic model of computation is”. In particular, whereas classical models assume that the attacker is a (perhaps non-uniform)...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Parallelizable Delegation from LWE
- Cody Freitag
  Cornell Tech, 10044, New York, NY, USA
  ,
- Rafael Pass
  Cornell Tech, 10044, New York, NY, USA
  Tel Aviv University, Tel Aviv, Israel
  ,
- Naomi Sirkin
  Cornell Tech, 10044, New York, NY, USA
Theory of Cryptography•November 2022, pp 623-652• https://doi.org/10.1007/978-3-031-22365-5_22
Abstract
We present the first non-interactive delegation scheme for $P$ with time-tight parallel prover efficiency based on standard hardness assumptions. More precisely, in a time-tight delegation scheme—which we refer to as a SPARG (succinct parallelizable ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Public Access
Published By ACM
Published By ACM
SPARKs: Succinct Parallelizable Arguments of Knowledge
- Naomi Ephraim
  Cornell Tech, New York, NY, USA
  ,
- Cody Freitag
  Cornell Tech, New York, NY, USA
  ,
- Ilan Komargodski
  Hebrew University and NTT Research, Jerusalem, Israel
  ,
- Rafael Pass
  Cornell Tech, New York, NY, USA
Journal of the ACM, Volume 69, Issue 5•October 2022, Article No.: 31, pp 1-88 • https://doi.org/10.1145/3549523
We introduce the notion of a Succinct Parallelizable Argument of Knowledge (SPARK). This is an argument of knowledge with the following three efficiency properties for computing and proving a (non-deterministic, polynomial time) parallel RAM computation ...
0Citation
498
Downloads
Metrics
Total Citations0
Total Downloads498
Last 12 Months292
Last 6 weeks41
Export Citations
Save to Binder
View online with eReader
PDF
research-article
On one-way functions from NP-complete problems
- Yanyi Liu
  Cornell Tech
  ,
- Rafael Pass
  Cornell Tech and Tel-Aviv University, Israel
CCC '22: Proceedings of the 37th Computational Complexity Conference•July 2022, Article No.: 36, pp 1-24• https://doi.org/10.4230/LIPIcs.CCC.2022.36

We present the first natural NP-complete problem whose average-case hardness w.r.t. the uniform distribution over instances is equivalent to the existence of one-way functions (OWFs). The problem, which originated in the 1960s, is the Conditional Time-...
3Citation
Metrics
Total Citations3
Export Citations
Save to Binder
Get Access
research-article
Characterizing derandomization through hardness of Levin-Kolmogorov complexity
- Yanyi Liu
  Cornell Tech
  ,
- Rafael Pass
  Cornell Tech and Tel-Aviv University, Israel
CCC '22: Proceedings of the 37th Computational Complexity Conference•July 2022, Article No.: 35, pp 1-17• https://doi.org/10.4230/LIPIcs.CCC.2022.35

A central open problem in complexity theory concerns the question of whether all efficient randomized algorithms can be simulated by efficient deterministic algorithms. We consider this problem in the context of promise problems (i.e,. the prBPP v.s. ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Get Access
research-article
Communication complexity of byzantine agreement, revisited
- Ittai Abraham
  VMware Research, Haifa, Israel
  ,
- T.-H. Hubert Chan
  The University of Hong Kong, Hong Kong, Hong Kong
  ,
- Danny Dolev
  The Hebrew University of Jerusalem, Jerusalem, Israel
  ,
- Kartik Nayak
  Duke University, Durham, USA
  ,
- Rafael Pass
  Cornell Tech, New York, USA
  ,
- Ling Ren
  University of Illinois, Urbana-Champaign, Urbana, USA
  ,
- Elaine Shi
  Carnegie Mellon University, Pittsburgh, PA, USA
Distributed Computing, Volume 36, Issue 1•Mar 2023, pp 3-28 • https://doi.org/10.1007/s00446-022-00428-8
Abstract
As Byzantine Agreement (BA) protocols find application in large-scale decentralized cryptocurrencies, an increasingly important problem is to design BA protocols with improved communication complexity. A few existing works have shown how to ...
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
research-article
On the Complexity of Compressing Obfuscation
- Gilad Asharov
  Bar-Ilan University, 5290002, Ramat Gan , Israel
  ,
- Ilan Komargodski
  School of Computer Science and Engineering, Hebrew University, 91904, Jerusalem , Israel
  NTT Research, 94085, Sunnyvale, CA, USA
  ,
- Rafael Pass
  Cornell Tech, 10044, New York, NY , USA
  ,
- Naomi Sirkin
  Cornell Tech, 10044, New York, NY , USA
Journal of Cryptology, Volume 35, Issue 3•Jul 2022 • https://doi.org/10.1007/s00145-022-09431-5
Abstract
Indistinguishability obfuscation has become one of the most exciting cryptographic primitives due to its far-reaching applications in cryptography and other fields. However, to date, obtaining a plausibly secure construction has been an illusive ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Locality-Preserving Oblivious RAM
- Gilad Asharov
  Department of Computer Science, Bar-Ilan University, 5290002, Ramat-Gan, Israel
  ,
- T.-H. Hubert Chan
  Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong, SAR, China
  ,
- Kartik Nayak
  Department of Computer Science, Duke University, Durham, USA
  ,
- Rafael Pass
  Department of Computer Science, Cornell Tech, New York, USA
  ,
- Ling Ren
  Computer Science Department, University of Illinois at Urbana-Champaign, Urbana, USA
  ,
- Elaine Shi
  Computer Science and Electrical and Computer Engineering Departments, Carnegie Mellon University, Pittsburgh, USA
Journal of Cryptology, Volume 35, Issue 2•Apr 2022 • https://doi.org/10.1007/s00145-022-09419-1
Abstract
Oblivious RAMs, introduced by Goldreich and Ostrovsky [JACM’96], compile any RAM program into one that is “memory oblivious,” i.e., the access pattern to the memory is independent of the input. All previous ORAM schemes, however, completely break ... $^{}$
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Elette Boyle
  Technion Israel, Haifa, Israel
  ,
- Kai-Min Chung
  Academica Sinica, Taipei, Taiwan
  ,
- Rafael Pass
  Cornell University, Ithaca, USA
Advances in Cryptology -- CRYPTO 2015, pp 742-762• https://doi.org/10.1007/978-3-662-48000-7_36
Abstract
We present the first efficient (i.e., polylogarithmic overhead) method for securely and privately processing large data sets over multiple parties with parallel, distributed algorithms. More specifically, we demonstrate load-balanced, ...
12Citation
Metrics
Total Citations12
Export Citations
Save to Binder
Article
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
- Kai-Min Chung
  Academia Sinica, Taipei, Taiwan
  ,
- Huijia Lin
  University of California, Santa Barbara, USA
  ,
- Rafael Pass
  Cornell University, Ithaca, USA
Advances in Cryptology -- CRYPTO 2015, pp 287-307• https://doi.org/10.1007/978-3-662-47989-6_14
Abstract
We present a constant-round concurrent zero-knowledge protocol for $${\mathsf {NP}} $$. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations, and indistinguishability obfuscators for $$\...
11Citation
Metrics
Total Citations11
Export Citations
Save to Binder
Article
Non-malleable Time-Lock Puzzles and Applications
- Cody Freitag
  Cornell Tech, New York City, USA
  ,
- Ilan Komargodski
  Hebrew University, Jerusalem, Israel
  NTT Research, Palo Alto, USA
  ,
- Rafael Pass
  Cornell Tech, New York City, USA
  ,
- Naomi Sirkin
  Cornell Tech, New York City, USA
Theory of Cryptography•November 2021, pp 447-479• https://doi.org/10.1007/978-3-030-90456-2_15
Abstract
Time-lock puzzles are a mechanism for sending messages “to the future”, by allowing a sender to quickly generate a puzzle with an underlying message that remains hidden until a receiver spends a moderately large amount of time solving it. We ...
11Citation
Metrics
Total Citations11
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