On the public citation graph
Round-Optimal and Efficient Verifiable Secret Sharing
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/sfcs.1985.64openalex-snapshot
Verifiable secret sharing and achieving simultaneity in the presence of faults
inferredcites →https://doi.org/10.1145/277697.277716openalex-snapshot
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
inferredcites →https://doi.org/10.1145/380752.380853openalex-snapshot
The round complexity of verifiable secret sharing and secure multicast
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/73007.73014openalex-snapshot
Verifiable secret sharing and multiparty protocols with honest majority
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11818175_27openalex-snapshot
On Expected Constant-Round Protocols for Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_20openalex-snapshot
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-319-04268-8_12openalex-snapshot
Broadcast (and Round) Efficient Verifiable Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-319-49175-2_2openalex-snapshot
Dynamic and Verifiable Hierarchical Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-319-72089-0_6openalex-snapshot
Round and Communication Efficient Unconditionally-Secure MPC with $$t
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_41openalex-snapshot
Improving the Round Complexity of VSS in Point-to-Point Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_18openalex-snapshot
Round-Efficient Secure Computation in Point-to-Point Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_7openalex-snapshot
Universally-Composable Two-Party Computation in Two Rounds
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_18openalex-snapshot
Almost-Everywhere Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_29openalex-snapshot
The Round Complexity of Verifiable Secret Sharing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-05445-7_5openalex-snapshot
Information Theoretically Secure Multi Party Set Intersection Re-visited
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_12openalex-snapshot
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_7openalex-snapshot
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_31openalex-snapshot
Secure Multiparty Computation with Minimal Interaction
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_23openalex-snapshot
Key Management in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_25openalex-snapshot
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
inferred← citeshttps://doi.org/10.1007/978-3-642-20728-0_14openalex-snapshot
The Round Complexity of Perfectly Secure General VSS
inferred← citeshttps://doi.org/10.1007/978-3-642-22348-8_17openalex-snapshot
Verifiable Secret Sharing with Comprehensive and Efficient Public Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_32openalex-snapshot
Computational Verifiable Secret Sharing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_42openalex-snapshot
Zero Knowledge LTCs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_12openalex-snapshot
On the Communication Complexity of Secure Computation
inferred← citeshttps://doi.org/10.1007/978-981-96-9098-5_15openalex-snapshot
Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience
inferred← citeshttps://doi.org/10.1007/s00145-013-9172-7openalex-snapshot
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s00446-013-0200-5openalex-snapshot
Asynchronous Byzantine Agreement with optimal resilience
inferred← citeshttps://doi.org/10.1007/s10586-017-0805-8openalex-snapshot
PCS: a parity-based personal data recovery service in cloud
inferred← citeshttps://doi.org/10.1016/j.adhoc.2018.09.007openalex-snapshot
A secure and robust scheme for sharing confidential information in IoT systems
inferred← citeshttps://doi.org/10.1016/j.bcra.2025.100413openalex-snapshot
Separation of regulatory power considering users: Collaborative regulation with user data sovereignty compliance in anonymous privacy-preserving traceable blockchain
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.007openalex-snapshot
Improving the round complexity of VSS in point-to-point networks
inferred← citeshttps://doi.org/10.1016/j.ins.2010.04.016openalex-snapshot
Strong (n,t,n) verifiable secret sharing scheme
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.003openalex-snapshot
Verifiable secret sharing in a total of three rounds
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.06.014openalex-snapshot
Dynamic threshold secret reconstruction and its application to the threshold cryptography
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.07.009openalex-snapshot
Efficient VSS free of computational assumption
inferred← citeshttps://doi.org/10.1016/j.optcom.2011.12.003openalex-snapshot
Steganography and authentication in image sharing without parity bits
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.012openalex-snapshot
Perennial secure multi-party computation of universal Turing machine
inferred← citeshttps://doi.org/10.1038/s41534-019-0131-5openalex-snapshot
Foiling covert channels and malicious classical post-processing units in quantum key distribution
inferred← citeshttps://doi.org/10.1049/iet-cdt.2018.5167openalex-snapshot
RASSS: a hijack‐resistant confidential information management scheme for distributed systems
inferred← citeshttps://doi.org/10.1109/access.2024.3366688openalex-snapshot
A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions
inferred← citeshttps://doi.org/10.1109/dft.2017.8244432openalex-snapshot
RASSS: A perfidy-aware protocol for designing trustworthy distributed systems
inferred← citeshttps://doi.org/10.1109/glocom.2009.5426213openalex-snapshot
Multi-Path Key Establishment against REM Attacks in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/isbast.2013.46openalex-snapshot
Protecting Data Privacy and Security for Cloud Computing Based on Secret Sharing
inferred← citeshttps://doi.org/10.1109/tit.2016.2614685openalex-snapshot
An Efficient Framework for Unconditionally Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1109/tit.2018.2886262openalex-snapshot
Verifiably Multiplicative Secret Sharing
inferred← citeshttps://doi.org/10.1109/tit.2023.3264444openalex-snapshot
Perfectly-Secure Synchronous MPC With Asynchronous Fallback Guarantees
inferred← citeshttps://doi.org/10.1109/tit.2025.3642814openalex-snapshot
Network-Agnostic Verifiable Secret Sharing With Cryptographic Security
inferred← citeshttps://doi.org/10.1145/1582716.1582736openalex-snapshot
Simple and efficient asynchronous byzantine agreement with optimal resilience
inferred← citeshttps://doi.org/10.1145/3007748.3007774openalex-snapshot
Multi-valued Asynchronous Reliable Broadcast with a Strict Honest Majority
inferred← citeshttps://doi.org/10.1145/3433210.3437516openalex-snapshot
Non-Equivocation in Blockchain: Double-Authentication-Preventing Signatures Gone Contractual
inferred← citeshttps://doi.org/10.1145/3564246.3585228openalex-snapshot
The Round Complexity of Statistical MPC with Optimal Resiliency
inferred← citeshttps://doi.org/10.1155/2020/1039898openalex-snapshot
A New Efficient and Secure Secret Reconstruction Scheme (SSRS) with Verifiable Shares Based on a Symmetric Bivariate Polynomial
inferred← citeshttps://doi.org/10.2498/cit.1002593openalex-snapshot
Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.