Kurt Pan 密码周刊 (13)

Papers

• Quantum-access security of the Winternitz one-time signature scheme

• fill a gap in, the quantum-access security analysis of the Lamport one-time signature scheme (OTS) in the quantum random oracle model (QROM) by Alagic et al. (Eurocrypt 2020). / go on to generalize the technique to the Winternitz OTS. /develop a tool for the analysis of hash chains in the QROM based on the superposition oracle technique by Zhandry (Crypto 2019)
• https://eprint.iacr.org/2021/387.pdf

• Topology-Hiding Communication from Minimal Assumptions: https://eprint.iacr.org/2021/388.pdf

• Quantum Encryption with Certified Deletion: Public Key and Attribute-Based

• construct a (reusable-key) public key encryption (PKE) and attribute-based encryption (ABE) with certified deletion. /PKE with certified deletion is constructed assuming the existence of IND-CPA secure PKE / ABE with certified deletion is constructed assuming the existence of indistinguishability obfuscation and one-way function
• https://eprint.iacr.org/2021/394.pdf

• LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action: https://eprint.iacr.org/2021/396.pdf

• SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq

• introducing SSProve, the first general verification framework for machine-checked state-separating proofs
• https://eprint.iacr.org/2021/397.pdf

• Cryptanalysis of the Binary Permuted Kernel Problem: https://eprint.iacr.org/2021/398.pdf

• Latus Incentive Scheme: Enabling Decentralization in Blockchains based on Recursive SNARKs

• introducing details of the incentive scheme for the Latus sidechain. Represented ideas can also be adopted by other SNARK-based blockchains to incentivize decentralized proofs creation.
• https://eprint.iacr.org/2021/399.pdf

• Size of IK00 Branching Program: https://eprint.iacr.org/2021/400.pdf

• Chain Reductions for Multi-Signatures

• For classical 3-round schemes give AGM proofs with tight bounds. / give a new 2-round multi-signature scheme, as efficient as prior ones, for which we prove a tight AGM bound. /These results are obtained via a framework in which a reduction is broken into a chain of sub-reductions involving intermediate problems./ By giving as many as possible of the sub-reductions tightly in the standard model, we minimize use of the AGM, and also hedge the AGM proofs with standard-model ones from different starting points.
• https://eprint.iacr.org/2021/404.pdf

• Disappearing Cryptography in the Bounded Storage Model

• propose the notion of online obfuscation, capturing the goal of disappearing programs in the bounded storage model.
• https://eprint.iacr.org/2021/406.pdf

• Limitations on Uncloneable Encryption and Simultaneous One-Way-to-Hiding: https://eprint.iacr.org/2021/408.pdf

• On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols: https://eprint.iacr.org/2021/409.pdf

• Blind Polynomial Evaluation and Data Trading: https://eprint.iacr.org/2021/413.pdf

• Cryptanalysis of an Anonymous Identity-based Identification Scheme in Ad-Hoc Group without Pairings: https://eprint.iacr.org/2021/414.pdf

• Cryptocurrencies with Security Policies and Two-Factor Authentication: https://eprint.iacr.org/2021/416.pdf

• History Binding Signature: https://eprint.iacr.org/2021/417.pdf

• Ring-LWE over two-to-power cyclotomics is not hard: https://eprint.iacr.org/2021/418.pdf

• Candidate Obfuscation of Null Quantum Circuits and Witness Encryption for QMA: https://eprint.iacr.org/2021/421.pdf

• Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions: https://eprint.iacr.org/2021/422.pdf

• NaturalProofs: Mathematical Theorem Proving in Natural Language: https://wellecks.github.io/naturalproofs/

IACR Test-of-Time Awards 2021

https://iacr.org/testoftime/

• A provable-security treatment of the key-wrap problem, by Phillip Rogaway and Thomas Shrimpton

• For placing the important real world primitive of key-wrapping on a solid theoretic foundation.

• New proofs for NMAC and HMAC: Security without collision-resistance, by Mihir Bellare

• For proving that the security of the widely deployed HMAC construction does not depend on the collision resistance of the underlying hash function.

• Simulation-sound NIZK proofs for a practical language and constant size group signatures, by Jens Groth

• For constructing asymptotically optimal NIZK proofs and group signatures without using random oracles, and paving the way to practical constructions.

EuroSP 2021

https://www.ieee-security.org/TC/EuroSP2021/accepted.html

• Cryptocurrencies with Security Policies and Two-Factor Authentication
• DY*: A Modular Symbolic Verification Framework for Executable Cryptographic Protocol Code
• Epoque: Practical End-to-End Verifiable Post-Quantum-Secure E-Voting
• Fully Distributed Verifiable Random Functions and their Application to Decentralised Random Beacons: https://eprint.iacr.org/2020/096.pdf
• Privacy of DNS-over-HTTPS: Requiem for a Dream?
• Secure Messaging Authentication against Active Man-in-the-Middle Attacks

• School in Algorithms, Combinatorics, and Complexity: May 24 - May 28, 2021

• New horizons in theoretical computer science: May 31 to June 4, 2021

• https://clor.io/: Clorio: Mina wallet

• https://github.com/facebookresearch/Cupcake :  Rust library for the (additive version of) Fan-Vercauteren homomorphic encryption scheme

This is only a foretaste of what is to come, and only the shadow of what is going to be.