Kurt Pan 密码周刊 (8)

Papers

• Tensor Crypto

• employed tensor core to accelerate NTRU/ The proposed tensor core based polynomial convolution technique was applied to NTRU public key scheme (TensorTRU)/ extended the implementation to other lattice-based cryptosystems that have a small modulus (LAC and two variant parameter sets in FrodoKEM)
• https://eprint.iacr.org/2021/173.pdf

• Smart Contracts for Incentivized Outsourcing of Computation

• design an incentive mechanism that uses two lightweight response-checking protocols, and employ mone- tary reward, fine, and bounty to incentivize correct computation./ use game theory to model and analyze our mechanism, and prove that it has a single Nash equilibrium, corresponding to the contractors’ strategy of correctly computing the result.
• https://eprint.iacr.org/2021/174.pdf

• Attribute-Based Access Control for Inner Product Functional Encryption from LWE

• designing the first construction for an attribute-based FE scheme in key-policy setting for inner products from well-studied Learning With Errors (LWE) assumption.
• https://eprint.iacr.org/2021/178.pdf

• Group Signatures with User-Controlled and Sequential Linkability

• propose a new variant of group signatures that provides linkability in a flexible and user-centric manner.
• https://eprint.iacr.org/2021/181.pdf

• The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications

• show that key-recovery attacks against the Legendre PRF are equivalent to solving a specific family of multivariate quadratic (MQ) equation system over a finite prime field.
• https://eprint.iacr.org/2021/182.pdf

• Efficient State Management in Distributed Ledgers

• propose novel transaction optimization techniques to be followed by wallets, so as to create transactions that reduce the shared state cost
• https://eprint.iacr.org/2021/183.pdf

• Tight Security Bounds for Micali’s SNARGs

• present a new analysis that achieves tight security bounds
• https://eprint.iacr.org/2021/188.pdf

• Does Fiat-Shamir Require a Cryptographic Hash Function?

• https://eprint.iacr.org/2020/915.pdf

• PT-Symmetric Quantum State Discrimination for Attack on BB84 Quantum Key Distribution

• The security of QKD relies on the difficulty of the quantum state discrimination problem. / discover that the recent developments in PT symmetry can be used to expedite the quantum state discrimina- tion problem and therefore to attack the BB84 QKD scheme.
• https://eprint.iacr.org/2021/191.pdf

• Multitarget decryption failure attacks and their application to Saber and Kyber

• improve the state-of-the-art multitarget failure boosting attacks. / then improve the cost calculation of failure boosting and extend the applicability of these calculations to permit cost calculations of real-world schemes.
• https://eprint.iacr.org/2021/193.pdf

• Compilation of Function Representations for Secure Computing Paradigms

• introduces M-Circuits, a program representation which generalizes arithmetic and binary circuits./ show how this representation also allows one to construct zero knowledge proof (ZKP) systems based on the MPC-in-the-head paradigm.
• https://eprint.iacr.org/2021/195.pdf

• QCCA-Secure Generic Key Encapsulation Mechanism with Tighter Security in the Quantum Random Oracle Model

• give a tighter security reduction for the transformation KC that turns OW-CPA secure deter- ministic PKEs into modified DS secure PKEs in the QROM./ use the Measure-Rewind-Measure One-Way to Hiding Lemma recently in- troduced by Kuchta et al. (EUROCRYPT 2020) to avoid the square-root advantage loss.
• https://eprint.iacr.org/2021/196.pdf

• Generic, Efficient and Isochronous Gaussian Sampling over the Integers

• propose a secure, efficient exponential Bernoulli sampling algorithm. It can be applied to Gaussian samplers based on rejection samplings./develop a new Gaussian sampler based on rejection sam- pling./ improve the efficiency of the COSAC sampler (PQC’20).
• https://eprint.iacr.org/2021/199.pdf

• Manticore: Efficient Framework for Scalable Secure Multiparty Computation Protocols

• propose a novel MPC framework, Manticore, in the multiparty setting, with full threshold and semi-honest security model, supporting a combination of real number arithmetic (arithmetic shares), Boolean arithmetic (Boolean shares) and garbled circuits (Yao shares)./ introduce a novel highly efficient modular lifting/truncation method that stays in the arithmetic domain.
• https://eprint.iacr.org/2021/200.pdf

• Quantum Computationally Predicate-Binding Commitments with Application in Quantum Zero-Knowledge Arguments for NP

• study the binding property of the quantum string commitment scheme obtained by composing a generic quantum computationally-binding bit commitment scheme in parallel/ show that the resulting scheme satisfies a stronger quantum computational binding property than the trivial honest-binding, which we call predicate-binding.
• https://eprint.iacr.org/2020/1510.pdf

• A Cryptographic Analysis of the TLS 1.3 Handshake Protocol

• https://eprint.iacr.org/2020/1044.pdf

Posts & Videos

Resources & Events

• arkworks: An ecosystem for developing and programming with zkSNARKs

• https://github.com/arkworks-rs

• Fundamental Research Vol 1 Issue 1: https://www.sciencedirect.com/journal/fundamental-research/vol/1/issue/1

• Henry Yuen: Introduction to Quantum Computing

• http://www.henryyuen.net/classes/spring2021/

• Ph/CS 219A Quantum Computation

• https://www.youtube.com/watch?v=w08pSFsAZvE&list=PL0ojjrEqIyPy-1RRD8cTD_lF1hflo89Iu