skip to main content
10.1145/3384940acmconferencesBook PagePublication Pagesasia-ccsConference Proceedingsconference-collections
APKC '20: Proceedings of the 7th ACM Workshop on ASIA Public-Key Cryptography
ACM2020 Proceeding
  • Program Chairs:
  • Keita Emura,
  • Naoto Yanai
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ASIA CCS '20: The 15th ACM Asia Conference on Computer and Communications Security Taipei Taiwan 6 October 2020
ISBN:
978-1-4503-7607-5
Published:
07 October 2020
Sponsors:

Bibliometrics
Skip Abstract Section
Abstract

It is our great pleasure to welcome you to the 7th ACM Asia Public-Key Cryptography Workshop - APKC 2020, held on October 6, 2020, in conjunction with the 15th ACM ASIA Conference on Computer and Communications Security (ACM ASIACCS 2020). 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 20 submissions from Asia, Europe, and USA. The program committee accepted 6 papers based on their overall quality and novelty (acceptance ratio: 30%). The program also includes one invited talk entitled "Insider Collusion Attack on Distributed Machine Learning System and its Solutions -- A Case of SVM" by Dr. Peter Shaojui Wang. We hope these proceedings will serve as a valuable reference for researchers and practitioners in the field of public-key cryptography and its applications.

Skip Table Of Content Section
SESSION: Invited Talk
keynote
Insider Collusion Attack on Distributed Machine Learning System and its Solutions - A Case of SVM

Among several known data breaching problems, insider collusion attacks have been one of the fastest-growing threats. However, there are very few insider-related researches involving the distribution of kernel-based data mining, such as distributed ...

SESSION: Session 1
research-article
Six-Card Finite-Runtime XOR Protocol with Only Random Cut

Executing a card-based cryptographic protocol is an attractive way to perform secure multiparty computation (MPC) with a deck of physical cards. Crèpeau and Kilian at CRYPTO 1993 proposed card-based AND and XOR protocols that can deal with a logical ...

research-article
Efficient Zero-Knowledge Proofs of Graph Signature for Connectivity and Isolation Using Bilinear-Map Accumulator

To prove the graph relations such as the connectivity and the isolation for a certified graph, the system of graph signature and proofs have been proposed. In this system, an issuer generates a signature certifying the topology of an undirected graph, ...

research-article
Verification of Group Key Management of IEEE 802.21 using ProVerif

Home Energy Management Systems (HEMS) contain devices of multiple manufacturers. Also, a large number of groups of devices must be managed according to several clustering situations. Hence, since it is necessary to establish a common secret group key ...

SESSION: Session 2
research-article
Cryptanalysis of GiophantusTM Schemes against Hybrid Attack

The hybrid attack was proposed by Howgrave-Graham in CRYPTO2007, which was originally designed for the cryptanalysis of NTRU cryptosystems. In this paper, based on Howgrave-Graham's attack model, we propose a simulator of hybrid attack to evaluate the ...

research-article
Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem

Isogeny-based cryptography has received attention as a candidate of post-quantum cryptography (PQC), and its security is based on the hardness of isogeny problems. The idea of meet-in-the-middle (MITM) is a bidirectional search for a collision, and it ...

research-article
Exploiting Decryption Failures in Mersenne Number Cryptosystems

Mersenne number schemes are a new strain of potentially quantum-safe cryptosystems that use sparse integer arithmetic modulo a Mersenne prime to encrypt messages. Two Mersenne number based schemes were submitted to the NIST post-quantum standardization ...

Contributors
  • National Institute of Information and Communications Technology
  • Osaka University
  1. Proceedings of the 7th ACM Workshop on ASIA Public-Key Cryptography

    Recommendations

    Acceptance Rates

    Overall Acceptance Rate36of103submissions,35%
    YearSubmittedAcceptedRate
    APKC '199333%
    APKC '1820735%
    APKC '1710550%
    AsiaPKC '1624729%
    ASIAPKC '1422627%
    AsiaPKC '1318844%
    Overall1033635%