Kurt Pan 密码周刊 (6)

Papers

• MAKE: a Matrix Action Key Exchange

• public key exchange protocol based on a semidirect product of two cyclic (semi)groups of matrices over Zp.
• https://eprint.iacr.org/2021/116.pdf

• High-Threshold AVSS with Optimal Communication Complexity

• construct a dual-threshold AVSS protocol called Haven/ core component of Haven is a high-threshold AVSS scheme for small secrets based on polynomial commitments
• https://eprint.iacr.org/2021/118.pdf

• Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits

• present a MPC protocol based on GC which is both actively secure and supports the free-XOR technique, and which has communication complexity O(n) per party.
• https://eprint.iacr.org/2021/120.pdf

• Rabbit: Efficient Comparison for Secure Multi-Party Computation

• present a novel construction for general n- party private comparison, secure against an active adversary, in the dishonest majority setting.
• https://eprint.iacr.org/2021/119.pdf

• BooLigero: Improved Sublinear Zero Knowledge Proofs for Boolean Circuits

• modification “BooLigero” tailors Ligero for use in Boolean circuits to achieve a significant improvement in proof size.
• https://eprint.iacr.org/2021/121.pdf

• PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection

• first concretely efficient maliciously-secure multiparty PSI protocol.
• https://eprint.iacr.org/2021/122.pdf

• A Systematic Approach and Analysis of Key Mismatch Attacks on CPA-Secure Lattice-Based NIST Candidate KEMs

• transform the problem of finding the lower bound of queries into finding an optimal binary recovery tree (BRT), where the computations of the lower bounds become essentially the computations of certain Shannon entropy.
• https://eprint.iacr.org/2021/123.pdf

• Efficient Number Theoretic Transform Implementation on GPU for Homomorphic Encryption

• present an efficient and fast implementation of NTT, inverse NTT (INTT) and NTT- based polynomial multiplication operations for GPU platforms.
• https://eprint.iacr.org/2021/124.pdf

• Privacy Preserving and Resilient RPKI

• first distributed RPKI system, based on threshold signatures
• https://eprint.iacr.org/2021/125.pdf

• Cuproof: A Novel Range Proof with Constant Size

• By combining inner-product and Lagrange’s four-square theorem, we structure a range proof scheme which is called Cuproof.The scheme of Cuproof is based on the scheme of Bulletproofs.
• https://eprint.iacr.org/2021/127.pdf

• Lattice-based weak curve fault attack on ECDSA

• https://eprint.iacr.org/2021/129.pdf

• smartFHE: Privacy-Preserving Smart Contracts from Fully Homomorphic Encryption

• smartFHE framework allows users to build arbitrary decentralized applications that preserve input/output privacy for inputs belonging to the same user or even different users./ define notions for a privacy-preserving smart contract (PPSC) scheme along with its correctness and security.
• https://eprint.iacr.org/2021/133.pdf

• Cryptanalysis of a code-based signature scheme without trapdoors

• implement an attack on the recent attempt by Li, Xing and Yeo to produce a code-based signature scheme using the Schnorr-Lyubashevsky approach in the Hamming metric.
• https://eprint.iacr.org/2021/134.pdf

• Acyclicity Programming for Sigma-Protocols

• an alternative method for combining sigma-protocols into a single non-interactive system for a compound statement in the random oracle model. verifier complexity is linear in the size of the acyclicity program representation of P/additionally present an extension of our proof system, with verifier complexity linear in the monotone circuit size of P, in the common reference string model.
• https://eprint.iacr.org/2021/135.pdf

• Classic McEliece Implementation with Low Memory Footprint

• an implementation of Classic McEliece on an ARM Cortex-M4 processor, optimized to overcome memory constraints.
• https://eprint.iacr.org/2021/138.pdf

• Order-Fair Consensus in the Permissionless Setting

• initiate the investigation of order-fairness in the permissionless setting and provide two protocols that realize it.
• https://eprint.iacr.org/2021/139.pdf

• Practical and Scalable Access Control Mechanism for the Internet of Things

• a new system with access control key updates and direct user revocation/ Access control is done using Ciphertext-Policy Attribute-Based Encryption where attributes represent roles of de- vices within their networks./ based on a binary tree, to append time credentials.
• https://eprint.iacr.org/2021/140.pdf

• Advanced Lattice Sieving on GPUs, with Tensor Cores

• study GPU implementations of various state-of-the-art sieving algorithms for lattices (Becker-Gama-Joux 2015, Becker-Ducas-Gama-Laarhoven 2016, Herold-Kirshanova 2017) inside the General Sieve Kernel (G6K, Albrecht et al. 2019).
• https://eprint.iacr.org/2021/141.pdf

• The Bitcoin Cash Backbone Protocol

• the first formal cryptographic analysis of Bitcoin Cash’s target recalculation functions against all possible adversaries./ analysis in the bounded-delay network model with dynamic participation of miners, of both ASERT and SMA
• https://eprint.iacr.org/2021/143.pdf

Posts/ Videos

Resources

• https://qiskit.org

• IBM Quantum Experience

• https://quantum-computing.ibm.com/

• FOCS 2021: Call for Papers

• https://www.cs.yale.edu/homes/vishnoi/focs-2021-cfp.html

• CFAIL 2021 : Call for Papers

• https://www.cfail.org/call-for-papers

• The Sixth International Conference for Young Quantum Information Scientists (YQIS 6 or YQIS 2021) :

• https://indico.frib.msu.edu/event/31/
• April 12 to 16, 2021

• The 11th BIU Winter School on Cryptography: Cryptography in a Quantum World

• February 14-17, 2021
• http://cyber.biu.ac.il/event/the-11th-biu-winter-school-on-cryptography/