ACM Logo

APKC 2025

The 12th ACM ASIA Public-Key Cryptography Workshop

26 August 2025 • Hanoi, Vietnam

Paper Submission extended to 17 February 2025 (AOE)

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

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: 27 January 2025 (AOE) 17 February 2025 (AOE) (Extended)

1st Notification: 10 March 2025 17 March 2025

Re-Submission due: 24 March 2025

2nd Notification: 8 April 2025

Proceedings version due: 28 April 2025 25 May 2025

Workshop: 26 August 2025

Program

Timezone: All times are represented in ICT (GMT+7)
Note: Each presentation is allocated 20 minutes for presentation and 5 minutes for Q&A.
8:30-8:40 Opening Remark and Best Paper Award Ceremony
Session 1: Card-based Cryptography
Session Chair: Hiraku Morita
8:40-9:05 Best Paper

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)
9:05-9:30

Formal Verification and Proof of Impossibility for Four-Card XOR Protocols Using Only Random Cuts

Kazuhiro Fujita (Ibaraki University), Shota Ikeda (Ibaraki University), Kazumasa Shinagawa (University of Tsukuba/National Institute of Advanced Industrial Science and Technology) and Kazuki Yoneyama (Ibaraki University)
Session 2: Searchable Encryption
Session Chair: Hiraku Morita
9:30-9:55

Revisiting Relations of Security Notions in Searchable Encryption

Kazuki Sato (The University of Electro-Communications), Takumi Amada (The University of Electro-Communications), Kyoichi Asano (The University of Electro-Communications/National Institute of Advanced Industrial Science and Technology), Yohei Watanabe (The University of Electro-Communications/National Institute of Advanced Industrial Science and Technology), Mitsugu Iwamoto (The University of Electro-Communications) and Kazuo Ohta (The University of Electro-Communications/National Institute of Advanced Industrial Science and Technology)
9:55-10:20

SoK: Searchable Encryption with Differential Privacy

Christopher Johann Clarke (The University of Electro-Communications), Yugo Kasashima (The University of Electro-Communications), Kazuki Sato (The University of Electro-Communications) and Yohei Watanabe (The University of Electro-Communications)
10:20-10:40 Tea Break
Session 3: ZK, Encryption, and Signatures
Session Chair: Keita Emura
10:40-11:05

More Efficient Lattice-Based Zero-Knowledge Proofs with Straight-Line Extractability

Ngoc Khanh Nguyen (King's College London) and George O'Rourke (King's College London)
11:05-11:30

Practical Quantum Public Key Encryption from One-way Functions

Kyohei Sudo (The University of Osaka), Keisuke Fujii (The University of Osaka/RIKEN), Keisuke Hara (National Institute of Advanced Industrial Science and Technology/Yokohama National University), Kosuke Ito (The University of Osaka), Masayuki Tezuka (Institute of Science Tokyo) and Yusuke Yoshida (Institute of Science Tokyo)
11:30-11:55

On Key Substitution Attacks against Aggregate Signatures and Multi-Signatures

Yuuki Fujita (The University of Osaka), Yusuke Sakai (National Institute of Advanced Industrial Science and Technology), Kyosuke Yamashita (The University of Osaka/National Institute of Advanced Industrial Science and Technology) and Goichiro Hanaoka (National Institute of Advanced Industrial Science and Technology)
11:55-12:00 Closing

Submission

Submission Page

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

Instructions for authors

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.

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

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

apkc2025 at easychair.org

Past Workshops

Edition Location Year Details Acceptance Rates
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
Aarhus University and University of Copenhagen, Denmark

Web Chair

Yuto Imura
Kanazawa University, Japan

Program Committee

Katharina Boudgoust
CNRS, Univ Montpellier, LIRMM, France
Lennart Braun
Université Paris Cité, CNRS, IRIF, France
Dung Bui
Université Paris Cité, CNRS, IRIF, France
Yun-Hsin Chuang
National Cheng Kung University, Taiwan
Masayuki Fukumitsu
University of Nagasaki, Japan
Fuchun Guo
University of Wollongong, Australia
Shuai Han
Shanghai Jiao Tong University, China
Keisuke Hara
National Institute of Advanced Industrial Science and Technology, Japan
Ruei-Hau Hsu
National Sun Yat-sen University, Taiwan
Hyung Tae Lee
Chung-Ang University, Korea
Sayantan Mukherjee
Indian Institute of Technology Jammu, India
Daiki Miyahara
The University of Electro-Communications, Japan
Protik Paul
TU Darmstadt, Germany
Tran Viet Xuan Phuong
University of Arkansas, USA
Daniel Slamanig
Universität der Bundeswehr München, Germany
Kyosuke Yamashita
Osaka University, Japan
Kazuki Yoneyama
Ibaraki University, Japan
Rui Zhang
Chinese Academy of Sciences, China