2021 Proceeding- Program Chairs:
- Keita Emura,
- Yuntao Wang
It is our great pleasure to welcome you to the 8th ACM Asia Public-Key Cryptography Workshop - APKC 2021, held on June 7, 2021, in conjunction with the 16th ACM ASIA Conference on Computer and Communications Security (ACM ASIACCS 2021). Public-key cryptography plays an essential role in ensuring many security properties required in data processing of various kinds. The theme of this 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. The call for papers attracted 19 submissions from Asia and Europe. The program committee accepted 6 papers based on their overall quality and novelty (acceptance ratio: 31.6%). The program also includes one invited talk entitled “Mitaka: Faster, Simpler, Parallelizable and Maskable Hashand- Sign Signatures on NTRU Lattices” by Dr. Thomas Espitau (NTT Secure Platform Laboratories). We hope these proceedings will serve as a valuable reference for researchers and practitioners in the field of public-key cryptography and its applications.
Proceeding Downloads
Mitaka: Faster, Simpler, Parallelizable and Maskable Hash-and-Sign Signatures on NTRU Lattices
This talk introduces the Mitaka signature scheme: a new hash-and-sign signature scheme over NTRU lattices which can be seen as a variant of NIST finalist Falcon. It achieves comparable efficiency but is considerably simpler and easier to parallelize and ...
Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption
Chosen ciphertext security for lattice based encryption schemes is generally achieved through a generic transformation such as the Fujisaki-Okamoto transformation. This method requires full re-encryption of the plaintext during decapsulation, which ...
New Card-based Copy Protocols Using Only Random Cuts
In card-based cryptography, a commitment to a Boolean value is usually represented by two face-down cards of different colors or numbers, whose order specifies the one-bit value (namely, 0 or 1). One of the most important primitives in card-based ...
Efficient Threshold Public Key Encryption from the Computational Bilinear Diffie-Hellman Assumption
In this paper, we show the first efficient threshold public-key encryption (TPKE) scheme under the difficulty of search problems. More specifically, our TPKE scheme simultaneously achieves: (1) chosen ciphertext security (CCA security) under the ...
Perfect ZK Argument of Knowledge of Discrete Logarithm in A Cyclic Group with Unknown Order
ZK (zero knowledge) proof of knowledge of discrete logarithm (and sometimes extended to ZK proof of equality of discrete logarithms) in cyclic groups with unknown orders are widely employed in various cryptographic applications. To the best of our ...
Universally Composable Forward Secure Dynamic Searchable Symmetric Encryption
Kurosawa et al. formulate a universally composable (UC) security definition of dynamic searchable symmetric encryption (DSSE). They also show (weak) equivalence between the UC and the game-based definition, and introduce a UC secure DSSE scheme (KSOY ...
Receiver Selective Opening Chosen Ciphertext Secure Identity-Based Encryption
In the situation where there are one sender and multiple receivers, a receiver selective opening (RSO) attack for an identity-based encryption (IBE) scheme considers adversaries that can corrupt some of the receivers and get their user secret keys and ...
Index Terms
- Proceedings of the 8th ACM on ASIA Public-Key Cryptography Workshop
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| APKC '19 | 9 | 3 | 33% |
| APKC '18 | 20 | 7 | 35% |
| APKC '17 | 10 | 5 | 50% |
| AsiaPKC '16 | 24 | 7 | 29% |
| ASIAPKC '14 | 22 | 6 | 27% |
| AsiaPKC '13 | 18 | 8 | 44% |
| Overall | 103 | 36 | 35% |