Kurt Pan 密码周刊 (5)

Papers

• A New Efficient Identity-Based Encryption Without Pairing

• propose an IBE scheme based on a hybrid of Diffie-Hellman and RSA-like hardness assumption.
• https://eprint.iacr.org/2021/105.pdf

• MERCAT: Mediated, Encrypted, Reversible, SeCure Asset Transfers

• proposes leveraging a hybrid design approach, by using zero-knowledge proofs, supported by restrictions enforced by trusted mediators./a novel transaction ordering mechanism
• https://eprint.iacr.org/2021/106.pdf

• A Decentralized and Encrypted National Gun Registry

• a decentralized and end-to-end encrypted national gun registry/ a decentralized system of locally-managed end-to-end encrypted databases/relies on various cryptographic building blocks including structured encryption, secure multi-party computation and secret sharing.
• https://eprint.iacr.org/2021/107.pdf

• Replacing Probability Distributions in Security Games via Hellinger Distance

• statistical distance->Hellinger distance/ leftover hash lemma can be strengthened to the Hellinger distance.
• https://eprint.iacr.org/2021/110.pdf

• Implementing CRYSTALS-Dilithium Signature Scheme on FPGAs

• the first VHDL implementation of the CRYSTALS-Dilithium signature scheme for FPGA/ on Virtex 7 UltraScale+ FPGAs
• https://eprint.iacr.org/2021/108.pdf

• A note on Post Quantum Onion Routing

• analysed the current cryptographic approaches for making TOR quantum-resistant.
• https://eprint.iacr.org/2021/111.pdf

• Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange

• an efficient and secure MP-NIKE scheme/MP-NIKE can be realized by using multilinear maps
• https://eprint.iacr.org/2021/112.pdf

• Fast Strategies for the Implementation of SIKE Round 3 on ARM Cortex-M4

• the fastest practical implementation of SIKE, targeting the platform Cortex-M4 based on the ARMv7-M architecture.
• https://eprint.iacr.org/2021/115.pdf

• Improvement of Secure Multi-Party Multiplication of (𝒌, 𝒏) Threshold Secret Sharing Using Only 𝑵 = 𝒌 Servers

• propose a method of computing (𝑘 − 1) sharing of multiplication 𝑎𝑏 by using only 𝑁 = 𝑘 servers. By allowing each server to hold two shares, we realize MPC of multiplication with the setting of 𝑁 = 𝑘, 𝑛 ≥ 2𝑘−1.
• https://eprint.iacr.org/2021/113.pdf

• On Succinct Arguments and Witness Encryption from Groups

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

• On Higher-Order Cryptography: https://arxiv.org/pdf/2002.07218.pdf

Posts

Resourses

• QIP 2021 Talks : https://www.youtube.com/playlist?list=PL5DZ45amUsqIaqE9EIemfc9LzeWzXnGY_

• Satisfiability: Theory, Practice, and Beyond Boot Camp: https://simons.berkeley.edu/workshops/schedule/14843

• Quantum Computing - 0 to 1: https://uncertain-systems.com

• Unbound MPC Labs: https://www.unboundtech.com/unbound-mpc-labs/

• https://github.com/ZenGo-X/awesome-tss

• 安比：零知识证明学习资源汇总: https://github.com/sec-bit/learning-zkp/blob/master/zkp-resource-list.md

• Cryptography FM: https://www.cryptography.fm/episodes

• https://microsoft.github.io/Picnic/

• NDSS 2021 Schedule: https://www.ndss-symposium.org/wp-content/uploads/NDSS-schedule.html