Kurt Pan 密码周刊 (39)

1Papers

• OpenSquare: Decentralized Repeated Modular Squaring Service

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

• Tight Computational Indistinguishability Bound of Product Distributions

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

• Counterexample to OWF Self-XOR Being a DOWF

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

• On the Security and Performance of Blockchain Sharding

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

• Leveled Fully Homomorphic Encryption Schemes with Hensel Codes

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

• Post-quantum Efficient Proof for Graph 3-Coloring Problem

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

• The Exact Security of BIP32 Wallets

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

• FO-like Combiners and Hybrid Post-Quantum Cryptography

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

• Verifiable Isogeny Walks: Towards an Isogeny-based Postquantum VDF

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

• Large-Scale Non-Interactive Threshold Cryptosystems Through Anonymity

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

• MyOPE: Malicious securitY for Oblivious Polynomial Evaluation

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

• Fast Extended GCD Calculation for Large Integers for Verifiable Delay Functions

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

• A Practical Verifiable Delay Function and Delay Encryption Scheme

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

• Quantum Money from Quaternion Algebras

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

• Towards Quantum Large-Scale Password Guessing on Real-World Distributions

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

• Report and Trace Ring Signatures

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

• An Isogeny-Based ID Protocol Using Structured Public Keys

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

• Black-Box Accumulation Based on Lattices

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

• (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin

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

• Selectively Linkable Group Signatures - Stronger Security and Preserved Verifiability

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

ESORICS 2021

https://esorics2021.athene-center.de/program.php

• An Explainable Online Password Strength Estimator
• MiniLedger: Compact-sized Anonymous and Auditable Distributed Payments
• Revocable Policy-Based Chameleon Hash
• Common Component in Black-Boxes is Prone to Attacks
• Fair Peer-to-Peer Content Delivery via Blockchain
• Succinct Scriptable NIZK via Trusted Hardware
• More efficient post-quantum KEMTLS with pre-distributed public keys
• One-time Traceable Ring Signatures
• MPC-in-Multi-Heads: a Multi-Prover Zero-Knowledge Proof System (or: How to Jointly Prove Any NP Statements in ZK)
• Multipath TLS 1.3
• Bestie: Very Practical Searchable Encryption with Forward and Backward Security
• Cache-Side-Channel Quantification and Mitigation for Quantum Cryptography
• Zero Knowledge Contingent Payments for Trained Neural Networks
• SyLPEnIoT: Symmetric Lightweight Predicate Encryption for Data Privacy Applications in IoT Environments
• More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE
• One-more Unforgeability of Blind ECDSA
• MLS group messaging: how Zero-Knowledge can secure Updates
• PACE with Mutual Authentication – towards an upgraded eID in Europe
• Complexity and Performance of Secure Floating-Point Polynomial Evaluation Protocols
• CoinJoin in the Wild - An Empirical Analysis in Dash
• Identity-based Identity-Concealed Authenticated Key Exchange
• Privacy-Preserving Authenticated Key Exchange: Stronger Privacy and Generic Constructions
• Lattice-based HRA-secure Attribute-based Proxy Re-Encryption in Standard Model
• Correlated Randomness Teleportation via Semi-trusted Hardware – Enabling Silent Multi-party Computation
• Efficient Multi-Client Order-Revealing Encryption and Its Applications
• Versatile and Sustainable Timed-Release Encryption and Sequential Time-Lock Puzzles
• Server-Aided Revocable Attribute-Based Encryption Revised: Multi-User Setting and Fully Secure
• Attribute-Based Conditional Proxy Re-Encryption in the Standard Model under LWE
• Polynomial Representation Is Tricky: Maliciously Secure Private Set Intersection Revisited
• Signature-in-signature: the Last Line of Defence in Case of Signing Key Compromise

TCC 2021

https://tcc.iacr.org/2021/acceptedpapers.php

• Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs
• On Derandomizing Yao’s Weak-to-Strong OWF Construction
• Information-Theoretically Secure MPC against Mixed Dynamic Adversaries
• Ring-based Identity Based Encryption – Asymptotically Shorter MPK and Tighter Security
• Distributed Merkle's Puzzles
• Secure Quantum Computation with Classical Communication
• Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness
• Two-Round Maliciously Secure Computation with Super-Polynomial Simulation
• Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity
• Tight Security Bounds for Micali’s SNARGs
• Simple Constructions from (Almost) Regular One-Way Functions
• On the Impossibility of Purely Algebraic Signatures
• Acyclicity Programming for Sigma-Protocols
• Statistical ZAPs from Group-Based Assumptions
• Adaptive Security of Multi-Party Protocols, Revisited
• Generalized Proofs of Knowledge with Fully Dynamic Setup
• Multi-Party Functional Encryption
• Policy-Compliant Signatures
• Post-quantum Resettably-Sound Zero Knowledge
• Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions
• On Actively-Secure Elementary MPC Reductions
• Succinct LWE Sampling, Random Polynomials, and Obfuscation
• Laconic Private Set Intersection and Applications
• Oblivious Transfer from Trapdoor Permutations in Minimal Rounds
• Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions
• Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments
• On Communication-Efficient Asynchronous MPC with Adaptive Security
• Efficient Perfectly Secure Computation with Optimal Resilience
• The Cost of Adaptivity in Security Games on Graphs
• ABE for DFA from LWE against Bounded Collusions, Revisited
• Non-Malleable Vector Commitments via Local Equivocability
• Non-Malleable Time-Lock Puzzles and Applications
• On Communication Models and Best-Achievable Security in Two-Round MPC
• Grafting Key Trees: Efficient Key Management for Overlapping Groups
• The Round Complexity of Quantum Zero-Knowledge
• Rate-1 Quantum Fully Homomorphic Encryption
• Direct Product Hardness Amplification
• Vector and Functional Commitments from Lattices
• Quantum Key-length Extension
• Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions
• BKW Meets Fourier: New Algorithms for LPN with Sparse Parities
• Updatable Public Key Encryption in the Standard Model
• Towards Tight Adaptive Security of Non-Interactive Key Exchange
• On expected polynomial runtime in cryptography
• Relationships between quantum IND-CPA notions
• Blockchains Enable Non-Interactive MPC
• Classical Binding for Quantum Commitments

• AFT'21

• Sept 26-28, 2021
• https://aft.acm.org/aft21/program.html

• ESORICS 2021

• October 4 - 8, 2021
• https://esorics2021.athene-center.de/program.php

• https://olvid.io/

今天，实现中华民族伟大复兴进入了不可逆转的历史进程。我们深知，越是接近民族复兴越不会一帆风顺，越充满风险挑战乃至惊涛骇浪。我们坚信，始终站在历史正确的一边，始终站在人类进步的一边，不畏风浪、直面挑战，风雨无阻向前进，就没有任何力量能够撼动我们伟大祖国的地位，没有任何力量能够阻挡中国前进的步伐！