APKC 2026

Call For Paper

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 2026 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.

Topics of interest include, but are not limited to:

• Applied public-key cryptography for solving emerging application problems
• Provably-secure public-key primitives and protocols
• Key management for, and by, public-key cryptosystems
• Privacy-preserving cryptographic computations
• Cryptographic protocols for blockchains
• Public-key cryptography for cryptocurrencies
• Two-party and multi-party computations
• Card-based cryptographic protocols
• Homomorphic public-key cryptosystems
• Post-quantum public-key cryptography
• Digital signatures with special properties
• System security properties of public-key cryptography
• Attributed-based and functional public-key cryptography
• Fast implementation of public-key cryptosystems

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.

Important Dates

Submission due: 20 January 2026 (AOE)

1st Notification: 9 March 2026

Re-Submission due: 16 March 2026

2nd Notification: 30 March 2026

Proceedings version due: 7 April 2026

Workshop: 2 June 2026

Program

TBA

Submission

Submission Page

https://easychair.org/conferences/?conf=apkc2026

Instructions for authors

APKC 2026 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 August 28, 2025. (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.

Double-blind Review Process

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 2026 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 2026, please make a registration for AsiaCCS 2026.

Conflict of Interest

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:

Anyone who shares an institutional affiliation with an author of the paper at the time of submission
Anyone who was the advisor or advisee of an author at any time in the past
Anyone the author has collaborated with or published within the prior two years

Contact Email

apkc2026 at easychair.org

Past Workshops

Edition	Location	Year	Details	Acceptance Rates
13th	Bangalore, India	2026	DBLP	Submitted , Accepted , Rate **%
12th	Hanoi, Vietnam	2025	DBLP	Submitted 18, Accepted 7, Rate 38.8%
11th	Singapore	2024	DBLP	Submitted 10, Accepted 6, Rate 60.0%
10th	Melbourne, Australia	2023	DBLP	Submitted 15, Accepted 4, Rate 26.7%
9th	Nagasaki, Japan	2022	DBLP	Submitted 13, Accepted 5, Rate 38.5%
8th	Hong Kong, China (Virtual Conference)	2021	DBLP	Submitted 19, Accepted 6, Rate 31.6%
7th	Taipei, Taiwan (Virtual Conference)	2020	DBLP	Submitted 20, Accepted 6, Rate 30.0%
6th	Auckland, New Zealand	2019	DBLP	Submitted 9, Accepted 3, Rate 33.3%
5th	Incheon, Korea	2018	DBLP	Submitted 20, Accepted 7, Rate 35.0%
4th	Abu Dhabi, UAE	2017	DBLP	Submitted 10, Accepted 5, Rate 50.0%
3rd	Xi'an, China	2016	DBLP	Submitted 24, Accepted 7, Rate 29.2%
2nd	Kyoto, Japan	2014	DBLP	Submitted 22, Accepted 6, Rate 27.3%
1st	Hangzhou, China	2013	DBLP	Submitted 18, Accepted 8, Rate 44.4%

APKC Best Papers

Paper	Year	Link
Single-Shuffle Physical Zero-Knowledge Proof for Sudoku Using Interactive Inputs Tomoki Ono (The University of Electro-Communications), Suthee Ruangwises (Chulalongkorn University), Yoshiki Abe (The University of Electro-Communication), Kyosuke Hatsugai (The University of Electro-Communication) and Mitsugu Iwamoto (The University of Electro-Communication)	2025	ACM
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

Organizers

Program Co-Chairs

Keita Emura

Kanazawa University, Japan

Hiraku Morita

University of Southern Denmark, Denmark

Web Chair

Takeshi Yoshida