Public key cryptography plays an essential role in ensuring many security properties required in data processing of various kinds. The theme of the ASIA Public-Key Cryptography (APKC) Workshop is novel public key cryptosystems for solving a wide range of real-life application problems. This workshop solicits original contributions on both applied and theoretical aspects of public key cryptography.
As in the previous APKC series, the proceedings of APKC 2025 will be published by ACM Press and appear in ACM digital library. This workshop may grant the Best Paper Award. For the sake of fairness, we will grant the award depending on an aggregate score, and it should get no rejection from its every reviewer. If no such paper exists, workshop organizers will reserve the right to present the award.
We solicit systematization of knowledge (SoK) papers, which should aim to evaluate, systematize, and contextualize existing knowledge. Although SoK papers may not necessarily contain novel research contributions, such papers must provide a high value to our community. Submissions will be distinguished by the prefix "SoK:" in the title.
Submission due: 27 January 2025 (AOE)
1st Notification: 10 March 2025
Re-Submission due: 24 March 2025
2nd Notification: 8 April 2025
Proceedings version due: 28 April 2025
Workshop: 26 August 2025
https://easychair.org/conferences/?conf=apkc2025
APKC 2025 adopts the following two-round submission policy. In the first round, authors will receive either an Accept or Reject decision. Meanwhile, a few authors may receive a Resubmission Notification, which means they are recommended to resubmit their papers with a response letter. In the second round, these resubmitted papers will receive either an Accept or Reject decision.
Technical papers submitted for APKC are to be written in English. Papers must be at most 8 pages excluding bibliography and appendices, and at most 10 pages in total. Committee members are not obligated to read appendices, and a paper must be intelligible without the appendices.
Submissions must follow the new ACM conference template (available here), which has been updated on June 4, 2024. (Use sigconf style) Submissions should not use older ACM formats or non-standard formatting. Submissions must be in Portable Document Format (.pdf). Authors should devote special care that fonts, images, tables and figures comply with common standards and do not generate problems for reviewers.
APKC requires a double-blind reviewing process. All submissions should be appropriately anonymized. Author names and affiliations should not appear in the paper. The authors should avoid obvious self-references and should appropriately blind them if used. The list of authors cannot be changed after the acceptance decision is made unless approved by the Program Chairs.
Submissions to APKC 2025 must not substantially overlap with papers that are published or simultaneously submitted to other venues (including journals or conferences/workshops). Double-submission will result in immediate rejection. Detected violations may be reported to other conference chairs and journal editors.
The Program Committee reserves the right to reject any paper that does not abide by the rules without considering its technical merits. Note that to attend APKC 2025, please make a registration for AsiaCCS 2025.
When submitting the paper, authors must declare the conflict of interest (COI) with the Program Committee members, including the chairs. Those who are considered COI include:
Edition | Location | Year | Details |
---|---|---|---|
11th | Singapore | 2024 | DBLP |
10th | Melbourne, Australia | 2023 | DBLP |
9th | Nagasaki, Japan | 2022 | DBLP |
8th | Hong Kong, China (Virtual Conference) |
2021 | DBLP |
7th | Taipei, Taiwan (Virtual Conference) |
2020 | DBLP |
6th | Auckland, New Zealand | 2019 | DBLP |
5th | Incheon, Korea | 2018 | DBLP |
4th | Abu Dhabi, UAE | 2017 | DBLP |
3rd | Xi'an, China | 2016 | DBLP |
2nd | Kyoto, Japan | 2014 | DBLP |
1st | Hangzhou, China | 2013 | DBLP |
Paper | Year | Link |
---|---|---|
Revisiting the security analysis of SNOVA Yasuhiko Ikematsu (Kyushu University) and Rika Akiyama (NTT Social Informatics Laboratories) |
2024 | ACM |
Few-helping-card Protocols for Some Wider Class of Symmetric Boolean Functions with Arbitrary Ranges Hayato Shikata (Tohoku University), Daiki Miyahara (The University of Electro-Communications/AIST), and Takaaki Mizuki (Tohoku University/AIST) |
2023 | ACM |
Order-Fair Consensus in the Permissionless Setting Mahimna Kelkar (Cornell Tech), Soubhik Deb (University of Washington, Seattle), and Sreeram Kannan (University of Washington, Seattle) |
2022 | ACM |
Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption Jan-Pieter D'Anvers (imec-COSIC KU Leuven), Emmanuela Orsini (imec-COSIC KU Leuven) and Frederik Vercauteren (imec-COSIC KU Leuven) |
2021 | ACM |
New Card-based Copy Protocols Using Only Random Cuts Hiroto Koyama (Tohoku University), Kodai Toyoda (Tohoku University), Daiki Miyahara (Tohoku University/AIST) and Takaaki Mizuki (Tohoku University/AIST) |
2021 | ACM |