Semi-quantum secret sharing that claims collusion security against a quantum third party and a dishonest classical player.
trending18
01 02 Graph-based multi-secret sharing gets 4-secret exact bounds and an n-secret one-bit characterization, because 3 secrets weren't enough.03 Multiparty HSS from two-party semi-private HSS, via party virtualization and DCR/class-group assumptions.04 Malicious-secure FSS gets a trusted GPU accelerator, plus authenticated output release and replay-proof bookkeeping.05 Turns Shamir into BIP39 mnemonics, with checksum/MAC validation and paper-only recovery, instead of another binary blob.06 Can secret shares be faked under coercion without spilling more? This paper says, only with lower bounds and assumptions.07 Jambon cuts threshold FHE decryption chatter with deterministic rounding, then proves UC security for BFV.08 Cryptanalysis of a Class of Ideal Secret Sharing Schemes Based on the CRT for Polynomial Rings arxiv.orgMultiple unauthorized coalitions recover the secret; the CRT-for-polynomial-rings scheme forgot to count all published polynomials.09 Can plain Shamir survive quantum leakage? Apparently yes under local leakage, until entanglement shows up.10 Almost every Boolean function needs nearly 2n bits of perfect CDS, so the one-bit secret still isn't cheap.11 Can secret sharing stay perfect when nobody knows whose share is whose? This preprint says yes, with 3-threshold and more.12 What's accepted here, a PQ publicly verifiable secret sharing paper with no NIZKs and a non-interactive dealer?13 Critical sets of Latin squares, now parameterized by autoparatopisms, with size bounds up to order 6 and a secret-sharing angle.14 Subexponential algorithms for a planted isotropic space problem, then the paper turns around and uses it for secret sharing.15 Fully Anonymous Perfect Threshold Secret Sharing: Explicit One-Bit Construction and Rate Amplification eprint.iacr.orgExplicit one-bit fully anonymous threshold sharing, plus rate amplification, where prior work had more handwaving than bits.16 Dynamic Participant Updates to Access and Adversary Structures for Ideal Secret Sharing Schemes Based on Linear Codes eprint.iacr.orgDynamic participant expansion for linear-code secret sharing, with exact adversary-structure updates and ideality results the old static...17 Physalia secret-shares stored data so redistributing it costs the full payload, because sharing keys was too easy.18 How much extra leakage do linear relations buy against Massey secret sharing? A paper extending LERS attacks to linked secrets.