Kurt Pan 密码周刊 (37)

Papers

• Computing Discrete Logarithms

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

• Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback

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

• The Elliptic Net Algorithm Revisited

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

• Recurring Contingent Payment for Proofs of Retrievability

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

• Key Encapsulation Mechanism with Tight Enhanced Security in the Multi-User Setting: Impossibility Result and Optimal Tightness

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

• Clockwork Finance: Automated Analysis of Economic Security in Smart Contracts

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

• Machine-checked ZKP for NP-relations: Formally Verified Security Proofs and Implementations of MPC-in-the-Head

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

• Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes

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

• Efficient Modular Multiplication

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

• Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field

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

• SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation

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

• Grafting Key Trees: Efficient Key Management for Overlapping Groups

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

• Compact and Malicious Private Set Intersection for Small Sets

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

• Classical Attacks on a Variant of the RSA Cryptosystem

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

• Balanced Non-Adjacent Forms

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

• Software Implementation of Optimal Pairings on Elliptic Curves with Odd Prime Embedding Degrees

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

• Information-Theoretically Secure MPC against Mixed Dynamic Adversaries

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

• fflonk: a Fast-Fourier inspired verifier efficient version of PlonK

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

• Downgradable Identity-Based Signatures and Trapdoor Sanitizable Signatures from Downgradable Affine MACs

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

• FAST: Secure and High Performance Format-Preserving Encryption and Tokenization

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

• Systematizing Core Properties of Pairing-Based Attribute-Based Encryption to Uncover Remaining Challenges in Enforcing Access Control in Practice

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

• Lelantus Spark: Secure and Flexible Private Transactions

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

• On Communication-Efficient Asynchronous MPC with Adaptive Security

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

• Adaptive Security of Multi-Party Protocols, Revisited

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

• Algebraic Restriction Codes and their Applications

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

• Onion Routing with Replies

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

• ZkAttest: Ring and Group Signatures on top of existing ECDSA keys

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

• On Time-Lock Cryptographic Assumptions in Abelian Hidden-Order Groups

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

• Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework)

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

• 矩阵元：实验室论文被《国家科学评论》录用

ACM CCS 2021 Accepted Papers

https://www.sigsac.org/ccs/CCS2021/accepted-papers.html

• Secure Source-Tracking for Encrypted Messaging
• LEAP: Leakage-Abuse Attack on Efficiently Deployable, Efficiently Searchable Encryption with Partially Known Dataset
• Key Agreement for Decentralized Secure Group Messaging with Strong Security Guarantees
• Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
• Meteor: Cryptographically Secure Steganography for Realistic Distributions
• Multi-Threshold Byzantine Fault Tolerance
• QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field
• Secure Multi-party Computation of Differentially Private Heavy Hitters
• ZKCPlus: Optimized Fair-exchange Protocol Supporting Practical and Flexible Data Exchange
• Revisiting Nakamoto Consensus in Asynchronous Networks: A Comprehensive Analysis of Bitcoin Safety and Chain Quality
• PPE Circuits for Rational Polynomials
• BFT Protocol Forensics
• Amortized Threshold Symmetric-key Encryption
• Shorter and Faster Post-Quantum zkSNARKs from Lattices
• RandPiper -- Reconfiguration-Friendly Random Beacons with Quadratic Communication
• With a Little Help from My Friends: Constructing Practical Anonymous Credentials
• Oblivious Linear Group Actions and Applications
• Revisiting Fuzzy Signatures: Towards a More Risk-Free Cryptographic Authentication System based on Biometrics
• TSS: Transformation-Specific Smoothing for Robustness Certification
• Hiding the Lengths of Encrypted Messages via Gaussian Padding
• Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI
• On the (in)security of ElGamal in OpenPGP
• Efficient Zero-knowledge MPCitH-based Arguments
• A Security Framework for Distributed Ledgers
• Biometrics-Authenticated Key Exchange for Secure Messaging
• How Does Blockchain Security Dictate Blockchain Implementation?
• The return of Eratosthenes: Secure Generation of RSA Moduli using Distributed Sieving
• Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication
• Structured Leakage and Applications to Cryptographic Constant-Time and Cost
• One Hot Garbling
• EasyPQC: Verifying Post-Quantum Cryptography
• SyncAttack: Double-spending in Bitcoin Without Mining Power
• Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time
• Machine-checked ZKP for NP relations: Formally Verified Security Proofs and Implementations of MPC-in-the-Head
• Simple, Fast Malicious Multiparty Private Set Intersection
• Efficient CCA Timed Commitments in Class Groups
• Compact and Malicious Private Set Intersection for Small Sets
• Util::Lookup: Exploiting key decoding in cryptographic libraries
• MPC-Friendly Commitments for Publicly Verifiable Covert Security
• DroneKey: A Drone-Aided Group-Key Generation Scheme for Large-Scale IoT Networks
• On Reengineering the X.509 PKI with Executable Specification for Better Implementation Guarantees
• Zero Knowledge Static Program Analysis
• Constant-Overhead Zero-Knowledge for RAM Programs
• Efficient Online-friendly Two-Party ECDSA Signature
• zkCNN: Zero Knowledge Proofs for Convolutional Neural Network Predictions and Accuracy
• A PKI-based Framework for Establishing Efficient MPC Channels
• The Exact Security of BIP32 Wallets
• OpenSquare: Decentralized Repeated Modular Squaring Service
• OnionPIR: Response Efficient Single-Server PIR
• Morpheus: Bringing The (PKCS) One To Meet the Oracle
• Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and
• The Security of ChaCha20-Poly1305 in the Multi-User Setting
• Let's Downgrade Let's Encrypt
• A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs
• Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing
• Modular Design of Secure Group Messaging Protocols and the Security of MLS

• Verifpal Tutorial

• https://verifpal.com/events/eurocrypt2021/

• Cryptographic Frontier 2021: Open Problems in Ethereum Research

• 17th October
• https://sites.google.com/view/cryptofrontier21

• ZK Hack

• Oct 26 – Dec 7
• https://www.zkhack.dev/