惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

H
Help Net Security
T
ThreatConnect
SecWiki News
SecWiki News
F
Future of Privacy Forum
AWS News Blog
AWS News Blog
C
Cisco Blogs
A
Arctic Wolf
Vercel News
Vercel News
The GitHub Blog
The GitHub Blog
Scott Helme
Scott Helme
V
V2EX
博客园 - 叶小钗
阮一峰的网络日志
阮一峰的网络日志
K
Kaspersky official blog
G
Google Developers Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
P
Privacy International News Feed
C
Cyber Attacks, Cyber Crime and Cyber Security
N
News | PayPal Newsroom
Schneier on Security
Schneier on Security
NISL@THU
NISL@THU
Microsoft Azure Blog
Microsoft Azure Blog
量子位
The Hacker News
The Hacker News
Stack Overflow Blog
Stack Overflow Blog
Security Latest
Security Latest
M
Microsoft Research Blog - Microsoft Research
Google Online Security Blog
Google Online Security Blog
博客园_首页
C
CXSECURITY Database RSS Feed - CXSecurity.com
I
InfoQ
Google DeepMind News
Google DeepMind News
Y
Y Combinator Blog
The Cloudflare Blog
Microsoft Security Blog
Microsoft Security Blog
Martin Fowler
Martin Fowler
Cisco Talos Blog
Cisco Talos Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
T
Troy Hunt's Blog
F
Fox-IT International blog
S
Security @ Cisco Blogs
博客园 - 司徒正美
cs.CV updates on arXiv.org
cs.CV updates on arXiv.org
C
Comments on: Blog
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
L
LINUX DO - 最新话题
GbyAI
GbyAI
Project Zero
Project Zero
腾讯CDC
T
Tailwind CSS Blog

Cryptology ePrint Archive

Related-Differential Distinguishers on up to 7 Rounds of AES Scaling Intelligence: Verifiable Decision Forest Inference with $\textit{Remainder}$ On Publicly Verifiable Tokens in Group Signatures with Message-Dependent Opening Resettable Non-Interactive Zero-Knowledge: Attacks and Defenses SoK: Rijndael-256 Vistrutah on FPGA: High-Throughput Pipelined Architecture and Comparison with Wider AES Variant A New Construction Method for More Efficient Quadratic One-Time Noisy Multi-Client Functional Encryption Schemes When Removing Reductions Goes Wrong: Auditing Reduction Placement in Production ML-DSA Implementations Compact Quaternion Algorithms for SQIsign Pushforward Problems and Applications to Isogeny-based Cryptography Towards a Unified Memory-Less Framework for TCitH Collusion-Resistant Asymmetric Anamorphic Encryption: Framework, Generic Construction, and Concrete Instantiations Computing Asymptotic Bounds for the Automated Coppersmith Method via Linear Programming Sparse Hermite Interpolation Method for Discrete-CKKS Functional Bootstrapping Geometric Critical Point Screening: Clustering-Free Cryptanalytic Extraction of Neural Network Models Separating the Pebbling Model from the Random Oracle Model Faster CoeffToSlot and SlotToCoeff for Sparsely Packed Ciphertexts with Application to CKKS Bootstrapping Thorns in Polynomial Convolution: Correlation, Large Deviations, and Applications Schnorr-like Proofs of Knowledge for Hidden Oil Subspaces in UOV On the Formal Verification of Authenticated Encryption of the MQTT Protocol On the Security of Public Key Authenticated Encryption with Keyword Search with Sender-independent Search Complexity Symmetric Attribute-Based Encryption from Minimal Hardness Assumptions Quantum and Post-Quantum Blockchain: A Systematic Survey Efficient Homomorphic String Search via TFHE Comments on "Server-Aided Public Key Authenticated Searchable Encryption With Constant Ciphertext and Constant Trapdoor" Updatable Public-Key Encryption from FESTA Sequence-Level Security for Active Weighted Signature Reconfiguration Linear self-equivalence of the known families of APN functions: a unified point of view Can We Tolerate Small Side-Channel Leakages: The Role of Registers in Glitch-Stopping Circuits Signal and Ready to MINGLE: In-Band Gossip for Key Transparency Split-View Detection in E2EE Messengers Constant-Online PVSS from CCA2-Secure Threshold Encryption: A Generic Framework Unified FPGA Design of Kyber and Dilithium with Provable Fault Tolerance Quantum Circuit Implementation and Grover’s Search on the Lightweight Block Cipher KLEIN Family Current trends in AI-Aided Cryptography More from Less: Composable General Multi-Party Computation with Global Public Verifiability from a Single Enclave Only PQKryvos: Post-Quantum Secure E-Voting With Flexible Ballot Formats and Public Tally-Hiding A Blockchain-Based Pre-Verification Access Control Scheme with Vector Commitments and Bulletproofs On weak keys of POK\'{E} Distributed Simon's Algorithm with Less Per-Node Qubit Overhead and Its Application to Cryptanalysis Information-Theoretic Optimistic Verifiable Secret Sharing Modern Portfolio Theory in the Crypto-Wilderness Balanced and Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Sub-Quadratic Communication Miraidon: MinRank Identification Topology-Hiding Computation From Key Agreement in Diameter-Two Graphs On Local Invariants for Permutation Equivalence Super-intelligence Survival Guide: Verification via Proof-Carrying Output Format-Preserving Encryption Creates a Privacy Attack Surface for Re-Identification Suppressing Hidden Extension-Field Linearity in Rank-Metric Cryptography via Structural Incompatibility DDYF: Differential Dolev-Yao Fuzzing of Cryptographic Protocols Single-Trace Power Analysis of LESS Key Generation BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs Maskaglia: A New, Efficient Approach to Masked Discrete Gaussian Sampling Impact of Post-Quantum Signatures on InnoDB B+-Trees and Efficient Batch Signing VeinoCert: Binding an Object to an Owner A New Insight into Constructing Cryptographic Boolean Functions via Walsh Spectral Analysis Quantum algorithm for Discrete Gaussian Sampling A formal analysis of FLEX and FLEX2 Zero-shot deep-unfolding decoder for QC-MDPC McEliece cryptosystems Profiling-Device-Free SASCA Framework for ML-KEM Key-Independent Secret-Key Distinguisher for 7-Round AES based on the Joint Generalized Zero-Difference Property Improved Dual Attack via Quantum Rejection Sampling Verifying Consensus Protocols from LLM-assisted TLA$^+$: A Case Study of Byzantine Reliable Broadcast ThriftyMPC: Reducing the Cost of Large-Scale MPC in the Cloud Revisiting DKLs Threshold ECDSA: Enhanced OT-based VOLE and Two-Party Signing Functional Bootstrapping for a Single LWE Ciphertext with \(\tilde{O}(1)\) Polynomial Multiplications LoTRS: Practical Post-Quantum Structured Threshold Ring Signatures from Lattices Asynchronous Lagrange-Based Threshold FHE with Smaller Modulus Overhead Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography Security Analysis on a Blockchain-based Public-Key Authenticated Searchable Encryption Scheme Icy-DVRF: A Distributed Verifiable Random Function based on FROST signatures Frobenius-UOV: A Very Efficient Multivariate Public Key Signature Scheme Revisiting Linear Subspace Trails in Poseidon2 and Neptune A New Multiscalar Multiplication Method Resistant to Timing Attacks Device Binding for Anonymous Credentials on Legacy Phones Beyond Quadratic: Unlocking Pseudorandomness with Quartic Character Multi-leveled and ISA/IEC 62443-aware Certificate Transparency to Protect the PKI Service Supply Chain of Operational Technology rBFT: a Revamped Two-Stage BFT from Delegated Committee Delving Deep into Security Guarantees against Integral Distinguishers with Applications to PRESENT, TWINE and LBLOCK On the Communication Complexity of Sleepy Consensus Operationalising Post‑Quantum TLS: Automated Configuration Profiling and Hybrid PQC Deployment in Financial Infrastructure Enhancing Blockchain Proof of Stake with Active Weighted Signatures: The ADAPT Framework Threshold FHE with Short Decryption Shares without a Semi-trusted Server Efficient Bootstrapping in Fully Homomorphic Encryption for Matrix Arithmetic YsPIR: HE-Based Single-Server Private Information Retrieval with Low Communication Cost and High Throughput Black-box validation of Falcon key generation under numerical instability Tight Lattice-Based Signatures without Trapdoors from Search LWE Formalizing Blockchain PQC Signature Transition: How to Outpace Quantum Adversaries Early-stopping Consensus with Adaptive Bit Complexity Beyond the Anonymous Inbox: Secure Whistleblowing for All Quantum Circuit Realization and Grover Cryptanalysis of the Hybrid ARX-SPN Cipher GFSPX Anamorphic Construction For The Winternitz OTS Scheme Family Efficient SIMD Implementation of the BLS Signature Scheme Using Intel AVX-512 Constant-Round Secure Distributed Decoding and HQC Threshold Decryption Threshold PRISM Signature Schemes via Graph-Based Threshold Access Structures On MPC-friendly Softmax Optimized G+G Signature On the Investigation of Variants for Discrete Logarithm Problems in Abelian Groups: An Algebraic Structure Approach MAYA: A Short Shuffle Argument With Fast Verification Efficiently deciding and recovering CCZ and EA equivalence for arbitrary vectorial Boolean functions using the partition refinement framework
Silent Threshold Encryption with One-Shot Adaptive Security
Mathias Hall · 2025-07-30 · via Cryptology ePrint Archive

Paper 2025/1384

Silent Threshold Encryption with One-Shot Adaptive Security

Mark Simkin, Flashbots, Aarhus University

Benedikt Wagner, Ethereum Foundation

Abstract

Threshold encryption enables a sender to encrypt a message towards $n$ recipients, such that any $t+1$ parties can decrypt the message, whereas any subset of size $t$ cannot. Silent threshold encryption additionally requires that all recipients can generate their public keys independently of each other, without engaging in an interactive distributed key generation protocol. In this work, we consider a relaxed notion of silent threshold encryption with \emph{soft} thresholds. In this setting, we choose parameters $c \in (0,1)$ and $\epsilon >0$, and we only require that $(c - \epsilon)n$ parties cannot, while $(c + \epsilon)n$ parties can decrypt the message. We present a simple blueprint for constructing efficient silent threshold encryption schemes for soft thresholds. Our construction has ciphertexts and recipient public keys, whose sizes are independent of $n$. As an exemplary data point, tolerating $t < n/3$ corruptions and encrypting $1$ MB results in a ciphertext of size $1.072$ MB. When instantiating our construction for the same parameters in a plausibly post-quantum secure manner, we have a ciphertext size of $1.431$ MB. Our construction is proven secure in the presence of \emph{one-shot adaptive corruptions}, a novel notion introduced in this work that conceptually lays between static and fully adaptive corruptions. We believe that the notion itself and our associated proof techniques are of independent interest. In comparison to prior works for the exact threshold setting, we have smaller recipient public keys, we do not rely on strong assumptions, such as indistinguishability obfuscation, or the generic group model, we are plausibly post-quantum secure, and we prove security for a non-trivial notion of adaptive corruptions.

BibTeX

@misc{cryptoeprint:2025/1384,
      author = {Mathias Hall-Andersen and Mark Simkin and Benedikt Wagner},
      title = {Silent Threshold Encryption with One-Shot Adaptive Security},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1384},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1384}
}