Guido Marco Bertoni
Applied Filters
- Guido Marco Bertoni
- AuthorRemove filter
People
Colleagues
- Luca Breveglieri (22)
- Gerardo Pelosi (8)
- Gilles van Assche (7)
- Joan Daemen (7)
- Michaël Peeters (7)
- Alessandro Barenghi (6)
- Pasqualina Fragneto (6)
- Israel Koren (5)
- Paolo Maistri (5)
- Filippo Melzani (4)
- Vincenzo Piuri (4)
- Christof Paar (3)
- Ruggero Susella (3)
- Thomas Wollinger (3)
- Marco F Marchetti (2)
- Matteo Venturi (2)
- Vittorio Zaccaria (2)
- Fabio Sozzani (1)
- Philippe Hoogvorst (1)
Publication
Proceedings/Book Names
- ITCC '05: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2)
- ITNG '06: Proceedings of the Third International Conference on Information Technology: New Generations (2)
- Applied Cryptography and Network Security (1)
- ASAP '06: Proceedings of the IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (1)
- CHES'10: Proceedings of the 12th international conference on Cryptographic hardware and embedded systems (1)
- CT-RSA'03: Proceedings of the 2003 RSA conference on The cryptographers' track (1)
- DATE '06: Proceedings of the conference on Design, automation and test in Europe: Designers' forum (1)
- DFT '04: Proceedings of the Defect and Fault Tolerance in VLSI Systems, 19th IEEE International Symposium (1)
- DSD '11: Proceedings of the 2011 14th Euromicro Conference on Digital System Design (1)
- EUROCRYPT'08: Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology (1)
- FDTC '09: Proceedings of the 2009 Workshop on Fault Diagnosis and Tolerance in Cryptography (1)
- GLSVLSI '04: Proceedings of the 14th ACM Great Lakes symposium on VLSI (1)
- ICCSA'06: Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III (1)
- ITNG '08: Proceedings of the Fifth International Conference on Information Technology: New Generations (1)
- ITNG '09: Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations (1)
- MICROW '12: Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture Workshops (1)
- PERCOMW '06: Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops (1)
- SAC'11: Proceedings of the 18th international conference on Selected Areas in Cryptography (1)
- SIN '11: Proceedings of the 4th international conference on Security of information and networks (1)
- SPACE 2015: Proceedings of the 5th International Conference on Security, Privacy, and Applied Cryptography Engineering - Volume 9354 (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- short-paperPublished By ACMPublished By ACM
CASCA: A Design Automation Approach for Designing Hardware Countermeasures Against Side-Channel Attacks
- Lorenzo Delledonne
STMicroelectronics, Italy
, - Vittorio Zaccaria
Politecnico di Milano, Italy
, - Ruggero Susella
STMicroelectronics, Italy
, - Guido Bertoni
Security Pattern, Italy
, - Filippo Melzani
Security Pattern, Italy
ACM Transactions on Design Automation of Electronic Systems, Volume 23, Issue 6•November 2018, Article No.: 69, pp 1-17 • https://doi.org/10.1145/3241047Implementing a cryptographic circuit poses challenges not always acknowledged in the backing mathematical theory. One of them is the vulnerability against side-channel attacks. A side-channel attack is a procedure that uses information leaked by the ...
- 3Citation
- 143
- Downloads
MetricsTotal Citations3Total Downloads143Last 12 Months9Last 6 weeks2
- Lorenzo Delledonne
- Article
KangarooTwelve: Fast Hashing Based on
- Guido Bertoni
Security Pattern, Brescia, Italy
, - Joan Daemen
STMicroelectronics, Diegem, Belgium
Radboud University, Nijmegen, The Netherlands
, - Michaël Peeters
STMicroelectronics, Diegem, Belgium
, - Gilles Van Assche
STMicroelectronics, Diegem, Belgium
, - Ronny Van Keer
STMicroelectronics, Diegem, Belgium
, - Benoît Viguier
Radboud University, Nijmegen, The Netherlands
Applied Cryptography and Network Security•July 2018, pp 400-418• https://doi.org/10.1007/978-3-319-93387-0_21AbstractWe present KangarooTwelve, a fast and secure arbitrary output-length hash function aiming at a higher speed than the FIPS 202’s SHA-3 and SHAKE functions. While sharing many features with SHAKE128, like the cryptographic primitive, the sponge ...
- 2Citation
MetricsTotal Citations2
- Guido Bertoni
- research-articlePublished By ACMPublished By ACM
A Fault-Based Secret Key Retrieval Method for ECDSA: Analysis and Countermeasure
- Alessandro Barenghi
Politecnico di Milano, Milano, Italy
, - Guido M. Bertoni
STMicroelectronics, Agrate Brianza, Italy
, - Luca Breveglieri
Politecnico di Milano, Milano, Italy
, - Gerardo Pelosi
Politecnico di Milano, Milano, Italy
, - Stefano Sanfilippo
Politecnico di Milano, Milano, Italy
, - Ruggero Susella
STMicroelectronics, Agrate Brianza, Italy
ACM Journal on Emerging Technologies in Computing Systems, Volume 13, Issue 1•January 2017, Article No.: 8, pp 1-26 • https://doi.org/10.1145/2767132Elliptic curve cryptosystems proved to be well suited for securing systems with constrained resources like embedded and portable devices. In a fault-based attack, errors are induced during the computation of a cryptographic primitive, and the results ...
- 7Citation
- 320
- Downloads
MetricsTotal Citations7Total Downloads320Last 12 Months19Last 6 weeks7
- Alessandro Barenghi
- Article
Simulations of Optical Emissions for Attacking AES and Masked AES
- Guido M. Bertoni
STMicroelectronics Agrate Brianza, Agrate Brianza, Italy
, - Lorenzo Grassi
STMicroelectronics Agrate Brianza, Agrate Brianza, Italy
, - Filippo Melzani
STMicroelectronics Agrate Brianza, Agrate Brianza, Italy
SPACE 2015: Proceedings of the 5th International Conference on Security, Privacy, and Applied Cryptography Engineering - Volume 9354•October 2015, pp 172-189• https://doi.org/10.1007/978-3-319-24126-5_11In this paper we present a novel attack based on photonic emission analysis targeting software implementations of AES. We focus on the particular case in which the attacker can collect the photonic emission of a limited number of sense amplifiers e.g. ...
- 0Citation
MetricsTotal Citations0
- Guido M. Bertoni
- article
Sufficient conditions for sound tree and sequential hashing modes
- Guido Bertoni
STMicroelectronics, Agrate, Italy
, - Joan Daemen
STMicroelectronics, Diegem, Belgium
, - Michaël Peeters
NXP Semiconductors, Haasrode, Belgium
, - Gilles Van Assche
STMicroelectronics, Diegem, Belgium
International Journal of Information Security, Volume 13, Issue 4•August 2014, pp 335-353 • https://doi.org/10.1007/s10207-013-0220-yHash functions are usually composed of a mode of operation on top of a concrete primitive with fixed input-length and fixed output-length, such as a block cipher or a permutation. In practice, the mode is often sequential, although parallel (or tree) ...
- 6Citation
MetricsTotal Citations6
- Guido Bertoni
- article
The Making of KECCAK
The sponge function KECCAK is the versatile successor of SHA-1 and the SHA-2 series of hash functions. Its structure and components are quite different from its predecessors, and at first sight it seems like a complete break with the past. In this ...
- 7Citation
MetricsTotal Citations7
- article
A fault induction technique based on voltage underfeeding with application to attacks against AES and RSA
- Alessandro Barenghi
Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB), Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milan, Italy
, - Guido M. Bertoni
STMicroelectronics s.r.l., Via C. Olivetti 2, I-20041 Agrate Bianza (MB), Italy
, - Luca Breveglieri
Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB), Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milan, Italy
, - Gerardo Pelosi
Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB), Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milan, Italy
Journal of Systems and Software, Volume 86, Issue 7•July, 2013, pp 1864-1878 • https://doi.org/10.1016/j.jss.2013.02.021Fault injection attacks have proven to be a powerful tool to exploit the implementation weaknesses of cryptographic algorithms. Several techniques perturbing the computation of a cipher have been devised and successfully employed to leak secret ...
- 12Citation
MetricsTotal Citations12
- Alessandro Barenghi
- Articlefree
Power Analysis of Hardware Implementations Protected with Secret Sharing
MICROW '12: Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture Workshops•December 2012, pp 9-16• https://doi.org/10.1109/MICROW.2012.12- 1Citation
- 46
- Downloads
MetricsTotal Citations1Total Downloads46Last 12 Months15Last 6 weeks3
- research-articlePublished By ACMPublished By ACM
Fault attack to the elliptic curve digital signature algorithm with multiple bit faults
- Alessandro Barenghi
Politecnico di Milano, Milan, Italy
, - Guido Marco Bertoni
STMicroelectronics, Milan, Italy
, - Luca Breveglieri
Politecnico di Milano, Milan, Italy
, - Gerardo Pelosi
Politecnico di Milano, Milan, Italy
, - Andrea Palomba
Politecnico di Milano, Milan, Italy
SIN '11: Proceedings of the 4th international conference on Security of information and networks•November 2011, pp 63-72• https://doi.org/10.1145/2070425.2070438Elliptic curve cryptosystems proved to be well suited for securing systems with constrained resources like embedded and portable devices. In a fault attack, errors are induced during the computation of a cryptographic primitive, and the faulty results ...
- 5Citation
- 216
- Downloads
MetricsTotal Citations5Total Downloads216Last 12 Months8Last 6 weeks3
- Alessandro Barenghi
- Article
On the Efficiency of Design Time Evaluation of the Resistance to Power Attacks
DSD '11: Proceedings of the 2011 14th Euromicro Conference on Digital System Design•August 2011, pp 777-785• https://doi.org/10.1109/DSD.2011.103Side-channel attacks are a realistic threat to the security of real world implementations of cryptographic algorithms. In order to evaluate the resistance of designs against power analysis attacks, power values obtained from circuit simulations in early ...
- 1Citation
MetricsTotal Citations1
- Article
Duplexing the sponge: single-pass authenticated encryption and other applications
- Guido Bertoni
STMicroelectronics, Belgium
, - Joan Daemen
STMicroelectronics, Belgium
, - Michaël Peeters
NXP Semiconductors, Belgium
, - Gilles Van Assche
STMicroelectronics, Belgium
SAC'11: Proceedings of the 18th international conference on Selected Areas in Cryptography•August 2011, pp 320-337• https://doi.org/10.1007/978-3-642-28496-0_19This paper proposes a novel construction, called duplex, closely related to the sponge construction, that accepts message blocks to be hashed and---at no extra cost---provides digests on the input blocks received so far. It can be proven equivalent to a ...
- 80Citation
MetricsTotal Citations80
- Guido Bertoni
- Article
Sponge-based pseudo-random number generators
- Guido Bertoni
STMicroelectronics
, - Joan Daemen
STMicroelectronics
, - Michaël Peeters
NXP Semiconductors
, - Gilles Van Assche
STMicroelectronics
CHES'10: Proceedings of the 12th international conference on Cryptographic hardware and embedded systems•August 2010, pp 33-47This paper proposes a new construction for the generation of pseudo-random numbers. The construction is based on sponge functions and is suitable for embedded security devices as it requires few resources. We propose a model for such generators and ...
- 10Citation
MetricsTotal Citations10
- Guido Bertoni
- Article
Low Voltage Fault Attacks on the RSA Cryptosystem
FDTC '09: Proceedings of the 2009 Workshop on Fault Diagnosis and Tolerance in Cryptography•September 2009, pp 23-31• https://doi.org/10.1109/FDTC.2009.30Fault injection attacks are a powerful tool to exploit implementative weaknessesof robust cryptographic algorithms. The faults induced during the computation of the cryptographic primitives allow to extract pieces of information about the secret ...
- 11Citation
MetricsTotal Citations11
- Article
Practical Power Analysis Attacks to RSA on a Large IP Portfolio SoC
ITNG '09: Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations•April 2009, pp 455-460• https://doi.org/10.1109/ITNG.2009.189The RSA algorithm is the most widely used public-key cryptosystem. For this reason it is important to protect RSA-based cryptosystems from the threat of Side Channels Attacks and particularly from Power Analysis.This article presents the application of ...
- 0Citation
MetricsTotal Citations0
- research-article
Security Evaluation of WDDL and SecLib Countermeasures against Power Attacks
- Sylvain Guilley
GET/ENST, PARIS
, - Laurent Sauvage
GET/ENST, PARIS
, - Philippe Hoogvorst
GET/ENST, PARIS
, - Renaud Pacalet
GET/ENST, Sophia Antipolis
, - Guido Marco Bertoni
STMicroelectronics, AGRATE B.za
, - Sumanta Chaudhuri
Institut TELECOM, TELECOM ParisTech CNRS LTCI
IEEE Transactions on Computers, Volume 57, Issue 11•November 2008, pp 1482-1497 • https://doi.org/10.1109/TC.2008.109Power-constant logic styles are promising solutions to counter-act side-channel attacks on sensitive cryptographic devices. Recently, one vulnerability has been identified in a standard-cell based power-constant logic called WDDL. Another logic, ...
- 8Citation
MetricsTotal Citations8
- Sylvain Guilley
- article
A pairing SW implementation for Smart-Cards
- Guido M. Bertoni
STMicroelectronics, Centro Direzionale Colleoni, I-20041 Agrate, Italy
, - Luca Breveglieri
Politecnico di Milano, P.zza L. Da Vinci, I-20133 Milano, Italy
, - Liqun Chen
HPLabs, Filton Road BS34 8QZ Bristol, United Kingdom
, - Pasqualina Fragneto
STMicroelectronics, Centro Direzionale Colleoni, I-20041 Agrate, Italy
, - Keith A. Harrison
HPLabs, Filton Road BS34 8QZ Bristol, United Kingdom
, - Gerardo Pelosi
Politecnico di Milano, P.zza L. Da Vinci, I-20133 Milano, Italy
Journal of Systems and Software, Volume 81, Issue 7•July, 2008, pp 1240-1247 • https://doi.org/10.1016/j.jss.2007.09.022The aim of this work is to show the feasibility of the primitives of the identity based cryptosystems for applications in Smart-Cards. Several observations are applied to easily choose many supersingular elliptic curves over a prime field F"p,p>3,p=...
- 3Citation
MetricsTotal Citations3
- Guido M. Bertoni
- Article
On the indifferentiability of the sponge construction
- Guido Bertoni
STMicroelectronics
, - Joan Daemen
STMicroelectronics
, - Michaël Peeters
NXP Semiconductors
, - Gilles Van Assche
STMicroelectronics
EUROCRYPT'08: Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology•April 2008, pp 181-197In this paper we prove that the sponge construction introduced in [4] is indifferentiable from a random oracle when being used with a random transformation or a random permutation and discuss its implications. To our knowledge, this is the first time ...
- 55Citation
- 5
- Downloads
MetricsTotal Citations55Total Downloads5
- Guido Bertoni
- Article
A FPGA Coprocessor for the Cryptographic Tate Pairing over Fp
ITNG '08: Proceedings of the Fifth International Conference on Information Technology: New Generations•April 2008, pp 112-119• https://doi.org/10.1109/ITNG.2008.260Identity based cryptography offers a number of functional advantages over traditional public key cryptosystems and has attracted much research interest in the last few years. The computational costs demanded for such functionalities result to be ...
- 4Citation
MetricsTotal Citations4
- Article
Speeding Up AES By Extending a 32 bit Processor Instruction Set
- Guido Marco Bertoni
ST Microelectronics Agrate Briaznza, Italy
, - Luca Breveglieri
Politecnico di Milano, Italy
, - Farina Roberto
CEFRIEL - Politecnico di Milano, Italy
, - Francesco Regazzoni
ALaRI, University of Lugano, Switzerland
ASAP '06: Proceedings of the IEEE 17th International Conference on Application-specific Systems, Architectures and Processors•September 2006, pp 275-282• https://doi.org/10.1109/ASAP.2006.62Nowadays the need of speed in cipher and decipher operations is more important than in the past. This is due to the diffusion of real time applications, which fact involves the use of cryptography. Many co-processors for cryptography were studied and ...
- 9Citation
MetricsTotal Citations9
- Guido Marco Bertoni
- Article
Performance of HECC coprocessors using inversion-free formulae
- Thomas Wollinger
Escrypt GmbH – Embedded Security, Bochum, Germany
, - Guido Bertoni
STMicroelectronics – Advanced System Technology – Agrate B., Milano, Italy
, - Luca Breveglieri
Politecnico di Milano, Italy
, - Christof Paar
Communication Security Group (COSY), Ruhr-Universitaet Bochum, Germany
ICCSA'06: Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III•May 2006, pp 1004-1012• https://doi.org/10.1007/11751595_105The HyperElliptic Curve Cryptosystem (HECC) was quite extensively studied during the recent years. In the open literature one can find results on how to improve the group operations of HECC as well as teh implementations for various types of processors. ...
- 0Citation
MetricsTotal Citations0
- Thomas Wollinger
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. 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