CT-RSA, or Cryptographers Track RSA Conference, is the venue for scientific papers on cryptography within the RSA Conference. For those who have never been the RSA Conference is the main trade show for the security industry; over 40,000 people attend the exhibition floor, keynote addresses, events, seminars, training events and the various technical tracks. CT-RSA is the track devoted to scientific papers on cryptography. As such CT-RSA is a great venue to ensure that scientific results not only get published to the wider cryptologic community, but also get exposed to technical attendees from industry, government and wider afield.
Original papers on all technical aspects of cryptology are solicited for submission. Topics included but are not limited to:
| Public-key algorithms | Symmetric-key algorithms | Hash functions |
| Random Number Generators | Cryptanalysis | Cryptographic protocols |
| Cryptographic standards | Cryptographic aspects of network security | CryptoCurrencies and blockchain |
| Efficient implementations | Elliptic-curve cryptography | Hardware security |
| Post-quantum cryptography | Voting Technologies | Side-channel attacks and defenses |
| Tamper-resistance | White-box cryptography |
Given the wider audience of the CT-RSA track within the RSA Conference itself, the committee will give a strong preference to papers which are of a broad interest to the security professional.
In addition, for the same reasons, we particularly welcome systematization of knowledge (SoK) papers, which should aim to evaluate, systematize, and contextualize existing knowledge. Such papers may not necessarily contain novel research contributions, but they should be of high value to the community. Examples of SoK papers could include survey papers that provide a new perspective on a research area, papers that support or challenge long-held beliefs with compelling evidence, or papers that provide an extensive and realistic evaluation of competing approaches to solving specific problems. Again SoK papers on cryptography which are of a broad interest to a security professional will be especially encouraged.
| Martin Albrecht | Royal Holloway University of London, UK |
| Josh Benaloh | Microsoft Research, USA |
| Alex Biryukov | University of Luxembourg, Luxembourg |
| Alexandra Boldyreva | Georgia Institute of Technology, USA |
| Joppe Bos | NXP, Belgium |
| David Cash | Rutgers University, USA |
| Junfeng Fan | Open Security Research, China |
| Tim Güneysu | University of Bremen and DFKI, Germany |
| Helena Handschuh | Rambus Cryptography Research, USA |
| Tibor Jager | Paderborn University, Germany |
| Stanislaw Jarecki | University of California at Irvine, USA |
| Marc Joye | NXP Semiconductors, USA |
| Florian Kerschbaum | University of Waterloo, Canada |
| Kwangjo Kim | KAIST, Republic of Korea |
| Susan Langford | Hewlett-Packard Enterprise, USA |
| Anja Lehmann | IBM Research Zurich, Switzerland |
| Tancrede Lepoint | SRI International, USA |
| Stefan Mangard | Graz University of Technology, Austria |
| Mitsuru Matsui | Mitsubishi Electric, Japan |
| David M'Raihi | Symphony, USA |
| Maria Naya-Plasencia | INRIA, France |
| Michael Naehrig | Microsoft Research, USA |
| Kaisa Nyberg | Aalto University (retired), Finland |
| Claudio Orlandi | Aarhus University, Denmark |
| Elisabeth Oswald | University of Bristol, UK |
| Raphael Phan | Multimedia University, Malaysia |
| David Pointcheval | Ecole Normale Superieure, France |
| Bart Preneel | KULeuven and iMinds, Belgium |
| Matt Robshaw | Impinj, USA |
| Rei Safavi-Naini | University of Calgary, Canada |
| Kazue Sako | NEC, Japan |
| Nigel Smart (Chair) | University of Bristol, UK |
| Douglas Stebila | McMaster University, Canada |
| Huaxiong Wang | Nanyang Technological University, Singapore |
Submissions must not substantially duplicate work that any of the authors has published/submitted in a journal or a conference/workshop with proceedings. Authors may also not submit the work to any other venue with published proceedings until the date of acceptance notification. Accepted submissions may not appear in any other conference or workshop that has proceedings. The CT-RSA 2018 chair reserves the right to share information about submissions with other program committees or journal editors to detect parallel submissions. In addition, the CT-RSA 2018 chair reserves the right to contact an author's institution/corporation and/or other appropriate organizations if an irregular submission is detected.
Submissions must be anonymous, with no author names, affiliations, acknowledgments, or obvious references. It should begin with a title, and a short abstract. The length of the main body of the paper should be at most 20 pages including bibliography using Springer's LNCS package (see instructions at http://www.springer.de/comp/lncs/authors.html), with no changes to the style.
Authors submitting an systematization of knowledge paper should have a title consisting of "SoK: Title". This is to ensure the committee are made aware that the paper is an SoK paper, and so will be reviewed with different criteria.
Any number of clearly marked appendices may be supplied following the main body of the paper. However, the committee members are not required to read appendices; the paper should be intelligible without them. Submissions not meeting these guidelines risk rejection without consideration of their merits.
Submitted papers must be in PDF format and should be submitted electronically to the above website.
The proceedings will be published in Springer's Lecture Notes in Computer Science series, and will be available at the conference. And will be limited to 20 pages including the bibliography. Thus the submitted paper should represent what you expect to finally publish.
Authors of accepted papers must guarantee that their paper will be presented at the conference. The presenter of each paper will be given a free Full Pass to the RSA Conference.
Conflict of Interest (COI) Policy
The only COI rule at CT-RSA 2018 is that the following direct
relationships constitute a conflict of interest: Colleagues in the same
department, and students and advisors. If you are not sure, please don't
hesitate to contact PC chair for advice.