On the public citation graph
Hash function‐based secret sharing scheme designs
0 signed · 33 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.1007/0-387-34805-0_39openalex-snapshot
A Design Principle for Hash Functions
inferredcites →https://doi.org/10.1007/11761679_12openalex-snapshot
Herding Hash Functions and the Nostradamus Attack
inferredcites →https://doi.org/10.1007/978-1-84800-273-9_12openalex-snapshot
Cryptography in theory and practice
inferredcites →https://doi.org/10.1007/978-3-540-28628-8_19openalex-snapshot
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
inferredcites →https://doi.org/10.1007/bf00198463openalex-snapshot
On the size of shares for secret sharing schemes
inferredcites →https://doi.org/10.1007/s00145-006-0334-8openalex-snapshot
Hierarchical Threshold Secret Sharing
inferredcites →https://doi.org/10.1007/s001459900029openalex-snapshot
The Size of a Share Must Be Large
inferredcites →https://doi.org/10.1007/s10623-008-9265-8openalex-snapshot
Detection and identification of cheaters in (t, n) secret sharing scheme
inferredcites →https://doi.org/10.1016/j.ipl.2005.09.012openalex-snapshot
Strongly secure ramp secret sharing schemes for general access structures
inferredcites →https://doi.org/10.1093/comjnl/37.3.199openalex-snapshot
Reusing Shares in Secret Sharing Schemes
inferredcites →https://doi.org/10.1109/icde.2009.151openalex-snapshot
Database Management as a Service: Challenges and Opportunities
inferredcites →https://doi.org/10.1201/9781420010756openalex-snapshot
Introduction to Modern Cryptography
inferredcites →https://doi.org/10.1515/gcc.2010.011openalex-snapshot
The Latin squares and the secret sharing schemes
inferredcites →https://doi.org/10.1587/transfun.e92.a.1808openalex-snapshot
A Fast (k,L,n)-Threshold Ramp Secret Sharing Scheme
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-20816-5_9openalex-snapshot
Multiple Share Creation with Optimal Hash Function for Image Security in WSN Aid of OGWO
inferred← citeshttps://doi.org/10.1007/s11128-018-1954-2openalex-snapshot
Simple hash function using discrete-time quantum walks
inferred← citeshttps://doi.org/10.1007/s11128-022-03416-wopenalex-snapshot
A quantum hash function with grouped coarse-grained boson sampling
inferred← citeshttps://doi.org/10.1007/s12190-025-02493-1openalex-snapshot
Enhanced multisecret-sharing schemes using LCD codes and weighing orthogonal matrices
inferred← citeshttps://doi.org/10.1080/19361610.2015.1069639openalex-snapshot
Implementations of a Hash Function Based Secret Sharing Scheme
inferred← citeshttps://doi.org/10.1109/access.2020.3002763openalex-snapshot
A New Hash Function Based on Chaotic Maps and Deterministic Finite State Automata
inferred← citeshttps://doi.org/10.1109/access.2021.3049881openalex-snapshot
A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence
inferred← citeshttps://doi.org/10.1109/bigdatasecurity-hpsc-ids58521.2023.00020openalex-snapshot
Cyber Attack Detection using Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/lisat.2017.8001961openalex-snapshot
Finding hash collisions using MPI on HPC clusters
inferred← citeshttps://doi.org/10.1109/lisat.2017.8001964openalex-snapshot
Finding partial hash collisions by brute force parallel programming
inferred← citeshttps://doi.org/10.1109/lisat.2018.8378028openalex-snapshot
Parallel hash collision search by Rho method with distinguished points
inferred← citeshttps://doi.org/10.1109/mesiicon55227.2022.10093356openalex-snapshot
Secret Sharing Scheme: Based on LCD Code
inferred← citeshttps://doi.org/10.1109/sarnof.2016.7846725openalex-snapshot
Finding partial hash collisions by brute force parallel programming
inferred← citeshttps://doi.org/10.17586/2226-1494-2025-25-3-446-456openalex-snapshot
Analysis of the applicability of existing secret separation schemes in the post-quaternary era
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2525513/v1openalex-snapshot
A Verifiable, Multi-Secret, Multi-Use Secret Sharing Scheme using Sponge functions and Cellular Automata
inferred← citeshttps://doi.org/10.22128/gadm.2016.59openalex-snapshot
Security Analysis of a Hash-Based Secret Sharing Scheme
inferred← citeshttps://doi.org/10.23919/icitst.2017.8356442openalex-snapshot
Applying dynamic verification tagging to the k-anonymity model
inferred← citeshttps://doi.org/10.54254/2753-8818/31/20240862openalex-snapshot
Blockchain security and applications: A comprehensive analysis from hash functions to consensus algorithms
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.