Zvika Brakerski

Applied Filters

Zvika Brakerski
AuthorRemove filter

Clear all

People

Colleagues

Zvika Brakerski (81)
Vinod Vaikuntanathan (15)
Yael Tauman Kalai (11)
Gil Segev (8)
Nico Döttling (8)
Boaz Patt-Shamir (7)
Rotem Tsabary (6)
Sanjam Garg (5)
Benny Applebaum (4)
Giulio Malavolta (4)
Daniel Wichs (3)
Guy N Rothblum (3)
Hoeteck Wee (3)
Ilan Komargodski (3)
Moni Naor (3)
Nir Bitansky (3)
Omri Shmueli (3)
Renen Perlman (3)
Shafi Goldwasser (3)
Aviv Nisgav (2)

Publication

Journal/Magazine Names

Journal of Cryptology (6)
Journal of the ACM (2)
ACM Transactions on Computation Theory (1)
Algorithmica (1)
Distributed Computing (1)
Journal of Algorithms (1)
SIAM Journal on Computing (1)
Wireless Networks (1)

Proceedings/Book Names

Theory of Cryptography (3)
Advances in Cryptology – CRYPTO 2023 (2)
Advances in Cryptology – EUROCRYPT 2019 (2)
CRYPTO'11: Proceedings of the 31st annual conference on Advances in cryptology (2)
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science (2)
Security and Cryptography for Networks (2)
TCC'11: Proceedings of the 8th conference on Theory of cryptography (2)
Theory of Cryptography (2)
Advances in Cryptology – ASIACRYPT 2019 (1)
Advances in Cryptology – CRYPTO 2020 (1)
Advances in Cryptology – CRYPTO 2020 (1)
Advances in Cryptology – CRYPTO 2021 (1)
Advances in Cryptology – EUROCRYPT 2019 (1)
Advances in Cryptology – EUROCRYPT 2020 (1)
Advances in Cryptology – EUROCRYPT 2020 (1)
Public-Key Cryptography – PKC 2020 (1)
Theory of Cryptography (1)
Theory of Cryptography (1)
Theory of Cryptography (1)
Theory of Cryptography (1)

All Publications

Proceedings (64)
Other periodicals (11)
Journals (3)
Books (2)

Publisher

Springer-Verlag (60)
Association for Computing Machinery (15)
IEEE Computer Society (3)
Society for Industrial and Applied Mathematics (2)
Academic Press, Inc. (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

81 Results for: Author: Zvika BrakerskiEdit 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,749,310 records)|Limit your search to The ACM Full-Text Collection (755,726 records)

Results

Showing 1 - 20of81 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

research-article
Published By ACM
Published By ACM
Quantum State Obfuscation from Classical Oracles
- James Bartusek
  University of California, Berkeley, Berkeley, USA
  ,
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Vinod Vaikuntanathan
  Massachusetts Institute of Technology, Boston, USA
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing•June 2024, pp 1009-1017• https://doi.org/10.1145/3618260.3649673

A major unresolved question in quantum cryptography is whether it is possible to obfuscate arbitrary quantum computation. Indeed, there is much yet to understand about the feasibility of quantum obfuscation even in the classical oracle model, where one ...
0Citation
48
Downloads
Metrics
Total Citations0
Total Downloads48
Last 12 Months48
Last 6 weeks13
Export Citations
Save to Binder
Get Access
Article
Pseudorandomness with Proof of Destruction and Applications
- Amit Behera
  https://ror.org/05tkyf982Department of Computer Science, Ben Gurion University of the Negev, Beersheba, Israel
  ,
- Zvika Brakerski
  https://ror.org/0316ej306Weizmann Institute of Science, Rehovot, Israel
  ,
- Or Sattath
  https://ror.org/05tkyf982Department of Computer Science, Ben Gurion University of the Negev, Beersheba, Israel
  ,
- Omri Shmueli
  https://ror.org/04mhzgx49Tel-Aviv University, Tel Aviv, Israel
Theory of Cryptography•November 2023, pp 125-154• https://doi.org/10.1007/978-3-031-48624-1_5
Abstract
Two fundamental properties of quantum states that quantum information theory explores are pseudorandomness and provability of destruction. We introduce the notion of quantum pseudorandom states with proofs of destruction (PRSPD) that combines both ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Simple Tests of Quantumness Also Certify Qubits
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Alexandru Gheorghiu
  Chalmers University of Technology, Gothenburg, Sweden
  ,
- Gregory D. Kahanamoku-Meyer
  Lawrence Berkeley National Laboratory, Berkeley, CA, USA
  University of California, Berkeley, CA, USA
  ,
- Eitan Porat
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Thomas Vidick
  Weizmann Institute of Science, Rehovot, Israel
  California Institute of Technology, Pasadena, CA, USA
Advances in Cryptology – CRYPTO 2023•August 2023, pp 162-191• https://doi.org/10.1007/978-3-031-38554-4_6
Abstract
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as [KCVY21, KLVY22], can ...
$^{} \frac{}{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Black-Hole Radiation Decoding Is Quantum Cryptography
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
Advances in Cryptology – CRYPTO 2023•August 2023, pp 37-65• https://doi.org/10.1007/978-3-031-38554-4_2
Abstract
We propose to study equivalence relations between phenomena in high-energy physics and the existence of standard cryptographic primitives, and show the first example where such an equivalence holds. A small number of prior works showed that high-...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
Article
SNARGs for Monotone Policy Batch NP
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Maya Farber Brodsky
  Tel Aviv University, Tel Aviv, Israel
  ,
- Yael Tauman Kalai
  Microsoft Research and MIT, Cambridge, USA
  ,
- Alex Lombardi
  Simons Institute and UC Berkeley, Berkeley, USA
  ,
- Omer Paneth
  Tel Aviv University, Tel Aviv, Israel
Advances in Cryptology – CRYPTO 2023•August 2023, pp 252-283• https://doi.org/10.1007/978-3-031-38545-2_9
Abstract
We construct a succinct non-interactive argument ( $SNARG$ ) for the class of monotone policy batch $NP$ languages, under the Learning with Errors ( $LWE$ ) assumption. This class is a subclass of $NP$ that is associated with a monotone function $f : {0, 1}^{k} \to {0, 1}...$ $_{}_{}$ $_{}_{}$ $_{}$ $_{}$
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
research-article
Candidate iO from Homomorphic Encryption Schemes
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Nico Döttling
  CISPA Helmoltz Center for Information Security, Saarbrücken, Germany
  ,
- Sanjam Garg
  University of California, Berkeley, Berkeley, USA
  ,
- Giulio Malavolta
  Max Planck Institute for Security and Privacy, Bochum, Germany
Journal of Cryptology, Volume 36, Issue 3•Jul 2023 • https://doi.org/10.1007/s00145-023-09471-5
Abstract
We propose a new approach to construct general-purpose indistinguishability obfuscation (iO). Our construction is obtained via a new intermediate primitive that we call split fully homomorphic encryption (split FHE), which we show to be sufficient ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Lattice Problems beyond Polynomial Time
- Divesh Aggarwal
  National University of Singapore, Singapore
  ,
- Huck Bennett
  Oregon State University, USA
  ,
- Zvika Brakerski
  Weizmann Institute of Science, Israel
  ,
- Alexander Golovnev
  Georgetown University, USA
  ,
- Rajendra Kumar
  Weizmann Institute of Science, Israel
  ,
- Zeyong Li
  National University of Singapore, Singapore
  ,
- Spencer Peters
  Cornell University, USA
  ,
- Noah Stephens-Davidowitz
  Cornell University, USA
  ,
- Vinod Vaikuntanathan
  Massachusetts Institute of Technology, USA
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing•June 2023, pp 1516-1526• https://doi.org/10.1145/3564246.3585227

We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time. Specifically, we revisit four foundational results in this context—two protocols and two worst-case to average-case ...
1Citation
153
Downloads
Metrics
Total Citations1
Total Downloads153
Last 12 Months116
Last 6 weeks13
Export Citations
Save to Binder
Get Access
Article
Constructive Post-Quantum Reductions
- Nir Bitansky
  Tel Aviv University, Tel Aviv, Israel
  ,
- Zvika Brakerski
  Weizmann Institute of Science, Rechovot, Israel
  ,
- Yael Tauman Kalai
  Microsoft Research, Cambridge, MA, USA
  Massachusetts Institute of Technology, Cambridge, MA, USA
Advances in Cryptology – CRYPTO 2022•August 2022, pp 654-683• https://doi.org/10.1007/978-3-031-15982-4_22
Abstract
Is it possible to convert classical reductions into post-quantum ones? It is customary to argue that while this is problematic in the interactive setting, non-interactive reductions do carry over. However, when considering quantum auxiliary input, ...
3Citation
Metrics
Total Citations3
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Quantum garbled circuits
- Zvika Brakerski
  Weizmann Institute of Science, Israel
  ,
- Henry Yuen
  Columbia University, USA
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing•June 2022, pp 804-817• https://doi.org/10.1145/3519935.3520073

In classical computing, garbled circuits (and their generalization known as randomized encodings) are a versatile cryptographic tool with many applications such as secure multiparty computation, delegated computation, depth-reduction of cryptographic ...
3Citation
237
Downloads
Metrics
Total Citations3
Total Downloads237
Last 12 Months87
Last 6 weeks8
Export Citations
Save to Binder
Get Access
Article
Batch-OT with Optimal Rate
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Pedro Branco
  IT, IST - University of Lisbon, Lisbon, Portugal
  ,
- Nico Döttling
  CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
  ,
- Sihang Pu
  CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Advances in Cryptology – EUROCRYPT 2022•May 2022, pp 157-186• https://doi.org/10.1007/978-3-031-07085-3_6
Abstract
We show that it is possible to perform n independent copies of 1-out-of-2 oblivious transfer in two messages, where the communication complexity of the receiver and sender (each) is $n (1 + o (1))$ for sufficiently large n. Note that this matches the ...
$^{}$
$_{}$ $_{}$ $_{}$ $_{}$ $_{}$
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
Article
From Selective to Adaptive Security in Functional Encryption
- Prabhanjan Ananth
  University of California, Los Angeles, USA
  ,
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Gil Segev
  Hebrew University of Jerusalem, Jerusalem, Israel
  ,
- Vinod Vaikuntanathan
  Massachusetts Institute of Technology, Cambridge, USA
Advances in Cryptology -- CRYPTO 2015, pp 657-677• https://doi.org/10.1007/978-3-662-48000-7_32
Abstract
In a functional encryption (FE) scheme, the owner of the secret key can generate restricted decryption keys that allow users to learn specific functions of the encrypted messages and nothing else. In many known constructions of FE schemes, ...
29Citation
Metrics
Total Citations29
Export Citations
Save to Binder
Article
Classical Binding for Quantum Commitments
- Nir Bitansky
  Tel Aviv University, Tel Aviv, Israel
  ,
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
Theory of Cryptography•November 2021, pp 273-298• https://doi.org/10.1007/978-3-030-90459-3_10
Abstract
In classical commitments, statistical binding means that for almost any commitment transcript there is at most one possible opening. While quantum commitments (for classical messages) sometimes have benefits over their classical counterparts (...
6Citation
Metrics
Total Citations6
Export Citations
Save to Binder
Article
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits
- Gorjan Alagic
  Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD, USA
  National Institute of Standards and Technology, Gaithersburg, MD, USA
  ,
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Yfke Dulek
  Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
  QuSoft, Amsterdam, The Netherlands
  ,
- Christian Schaffner
  University of Amsterdam, Amsterdam, The Netherlands
  QuSoft, Amsterdam, The Netherlands
Advances in Cryptology – CRYPTO 2021•August 2021, pp 497-525• https://doi.org/10.1007/978-3-030-84242-0_18
Abstract
Virtual black-box obfuscation is a strong cryptographic primitive: it encrypts a circuit while maintaining its full input/output functionality. A remarkable result by Barak et al. (Crypto 2001) shows that a general obfuscator that obfuscates ...
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
research-article
Open Access
Published By ACM
Published By ACM
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Paul Christiano
  OpenAI, USA
  ,
- Urmila Mahadev
  California Institute of Technology, Pasadena CA, USA
  ,
- Umesh Vazirani
  UC Berkeley, Berkeley CA, USA
  ,
- Thomas Vidick
  California Institute of Technology, Pasadena CA, USA
Journal of the ACM, Volume 68, Issue 5•October 2021, Article No.: 31, pp 1-47 • https://doi.org/10.1145/3441309
We consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial time bounded quantum device interacting with a classical polynomial time verifier. In this model, we propose solutions to two tasks—a protocol for ...
13Citation
1,392
Downloads
Metrics
Total Citations13
Total Downloads1,392
Last 12 Months407
Last 6 weeks47
Export Citations
Save to Binder
View online with eReader
PDF
research-article
Obfuscating Circuits Via Composite-Order Graded Encoding
- Benny Applebaum
  School of Electrical Engineering, Tel-Aviv University, Tel Aviv-Yafo, Israel
  ,
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
Journal of Cryptology, Volume 34, Issue 2•Apr 2021 • https://doi.org/10.1007/s00145-021-09378-z
Abstract
We present a candidate obfuscator based on composite-order graded encoding schemes (GES), which are a generalization of multilinear maps. Our obfuscator operates on circuits directly without converting them into formulas or branching programs as ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Perfect Secure Computation in Two Rounds
SIAM Journal on Computing, Volume 50, Issue 1, pp 68-97 • https://doi.org/10.1137/19M1272044

We show that any multiparty functionality can be evaluated using a 2-round protocol with perfect correctness and perfect semihonest security, provided that the majority of parties are honest. This settles the round complexity of information-theoretic ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
Article
Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Pedro Branco
  IT, IST - University of Lisbon, Lisbon, Portugal
  ,
- Nico Döttling
  Helmholtz Center for Information Security (CISPA), Saarbrücken, Germany
  ,
- Sanjam Garg
  UC Berkeley, Berkeley, USA
  ,
- Giulio Malavolta
  Max Planck Institute for Security and Privacy, Bochum, Germany
Theory of Cryptography•November 2020, pp 58-87• https://doi.org/10.1007/978-3-030-64375-1_3
Abstract
Non-committing encryption (NCE) is a type of public key encryption which comes with the ability to equivocate ciphertexts to encryptions of arbitrary messages, i.e., it allows one to find coins for key generation and encryption which “explain” a ...
7Citation
Metrics
Total Citations7
Export Citations
Save to Binder
Article
FHE-Based Bootstrapping of Designated-Prover NIZK
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Sanjam Garg
  University of California, Berkeley, Berkeley, USA
  ,
- Rotem Tsabary
  Weizmann Institute of Science, Rehovot, Israel
Theory of Cryptography•November 2020, pp 657-683• https://doi.org/10.1007/978-3-030-64375-1_23
Abstract
We present a novel tree-based technique that can convert any designated-prover NIZK proof system (DP-NIZK) which maintains zero-knowledge only for single statement, into one that allows to prove an unlimited number of statements in ZK, while ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
Article
Lossiness and Entropic Hardness for Ring-LWE
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Nico Döttling
  CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Theory of Cryptography•November 2020, pp 1-27• https://doi.org/10.1007/978-3-030-64375-1_1
Abstract
The hardness of the Ring Learning with Errors problem (RLWE) is a central building block for efficiency-oriented lattice-based cryptography. Many applications use an “entropic” variant of the problem where the so-called “secret” is not distributed ...
7Citation
Metrics
Total Citations7
Export Citations
Save to Binder
Article
Scalable Pseudorandom Quantum States
- Zvika Brakerski
  Weizmann Institute of Science, Rehovot, Israel
  ,
- Omri Shmueli
  Tel-Aviv University, Tel Aviv, Israel
Advances in Cryptology – CRYPTO 2020•August 2020, pp 417-440• https://doi.org/10.1007/978-3-030-56880-1_15
Abstract
Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational and physical uses. This is often referred to as pseudorandom (...
5Citation
Metrics
Total Citations5
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

Zvika Brakerski

Zvika Brakerski

Applied Filters

People

Colleagues

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

Quantum State Obfuscation from Classical Oracles

Pseudorandomness with Proof of Destruction and Applications

Simple Tests of Quantumness Also Certify Qubits

Black-Hole Radiation Decoding Is Quantum Cryptography

SNARGs for Monotone Policy Batch NP

Candidate iO from Homomorphic Encryption Schemes

Lattice Problems beyond Polynomial Time

Constructive Post-Quantum Reductions

Quantum garbled circuits

Batch-OT with Optimal Rate

From Selective to Adaptive Security in Functional Encryption

Classical Binding for Quantum Commitments

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits

A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

Obfuscating Circuits Via Composite-Order Graded Encoding

Perfect Secure Computation in Two Rounds

Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions

FHE-Based Bootstrapping of Designated-Prover NIZK

Lossiness and Entropic Hardness for Ring-LWE

Scalable Pseudorandom Quantum States