n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
How to share a secret
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 7roles
background 1polarities
background 1representative citing papers
Giskard is a new protocol using tree-structured log-sized committees and MPC-based approximate median to achieve scalable confidential and Byzantine-robust aggregation in decentralized learning.
Privatar uses horizontal frequency partitioning and distribution-aware minimal perturbation to enable private offloading of VR avatar reconstruction, supporting 2.37x more users with modest overhead.
DSLRS is a new ring signature primitive providing scoped linkability and decentralized accountability, proven secure under ECDLP and DDH in the random oracle model, with a blockchain instantiation for consent management.
SILMARILS is a new information-theoretic and quantum-secure transferable designated-verifier signature scheme constructed from Shamir secret sharing, with EUF-CMA^¬DV security proofs in ROM and QROM plus statistical security in the three-party case.
CPPDD is a new consensus-based protocol for privacy-preserving multi-client data sharing that achieves unanimous-release confidentiality, linear scalability, and high-probability malicious deviation detection.
Evaluates ECDSA-based threshold signatures on the Filia CBDC platform and reports that they improve security with acceptable computational and communication overhead for real deployments.
citing papers explorer
-
Sharp bounds for covering with large cliques and independent sets
n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
-
Giskard : Byzantine Robust and Confidential Aggregation for Large-Scale Decentralized Learning
Giskard is a new protocol using tree-structured log-sized committees and MPC-based approximate median to achieve scalable confidential and Byzantine-robust aggregation in decentralized learning.
-
Privatar: Scalable Privacy-preserving Multi-user VR via Secure Offloading
Privatar uses horizontal frequency partitioning and distribution-aware minimal perturbation to enable private offloading of VR avatar reconstruction, supporting 2.37x more users with modest overhead.
-
Deanonymizable Scoped Linkable Ring Signatures
DSLRS is a new ring signature primitive providing scoped linkability and decentralized accountability, proven secure under ECDLP and DDH in the random oracle model, with a blockchain instantiation for consent management.
-
SILMARILS: Information-Theoretic and Quantum-Secure Designated-Verifier Signatures
SILMARILS is a new information-theoretic and quantum-secure transferable designated-verifier signature scheme constructed from Shamir secret sharing, with EUF-CMA^¬DV security proofs in ROM and QROM plus statistical security in the three-party case.
-
Secure, Verifiable, and Scalable Multi-Client Data Sharing via Consensus-Based Privacy-Preserving Data Distribution
CPPDD is a new consensus-based protocol for privacy-preserving multi-client data sharing that achieves unanimous-release confidentiality, linear scalability, and high-probability malicious deviation detection.
-
Threshold Signatures for Central Bank Digital Currencies
Evaluates ECDSA-based threshold signatures on the Filia CBDC platform and reports that they improve security with acceptable computational and communication overhead for real deployments.