On the public citation graph
Bucket Hashing and Its Application to Fast Message Authentication
0 signed · 76 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.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1007/3-540-39799-x_6openalex-snapshot
Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences
inferredcites →https://doi.org/10.1007/3-540-44750-4_3openalex-snapshot
Bucket Hashing and its Application to Fast Message Authentication
inferredcites →https://doi.org/10.1007/3-540-48285-7_1openalex-snapshot
On the Relation Between A-Codes and Codes Correcting Independent Errors
inferredcites →https://doi.org/10.1007/3-540-48329-2_28openalex-snapshot
On Families of Hash Functions via Geometric Codes and Concatenation
inferredcites →https://doi.org/10.1007/3-540-48329-2_30openalex-snapshot
Codes for Interactive Authentication
inferredcites →https://doi.org/10.1007/3-540-48329-2_4openalex-snapshot
An Integrity Check Value Algorithm for Stream Ciphers
inferredcites →https://doi.org/10.1007/3-540-48658-5_15openalex-snapshot
LFSR-based Hashing and Authentication
inferredcites →https://doi.org/10.1007/3-540-48658-5_22openalex-snapshot
Incremental Cryptography: The Case of Hashing and Signing
inferredcites →https://doi.org/10.1007/3-540-48658-5_32openalex-snapshot
The Security of Cipher Block Chaining
inferredcites →https://doi.org/10.1007/3-540-57220-1_73openalex-snapshot
A fast cryptographic checksum algorithm based on stream ciphers
inferredcites →https://doi.org/10.1007/3-540-68697-5_1openalex-snapshot
Keying Hash Functions for Message Authentication
inferredcites →https://doi.org/10.1007/3-540-68697-5_24openalex-snapshot
On Fast and Provably Secure Message Authentication Based on Universal Hashing
inferredcites →https://doi.org/10.1007/3-540-69053-0_12openalex-snapshot
Bucket Hashing with a Small Key Size
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_7openalex-snapshot
On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys
inferredcites →https://doi.org/10.1007/bf01388651openalex-snapshot
Universal hashing and authentication codes
inferredcites →https://doi.org/10.1007/bfb0052345openalex-snapshot
MMH: Software message authentication in the Gbit/second rates
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot
New hash functions and their use in authentication and set equality
inferredcites →https://doi.org/10.1109/5.4445openalex-snapshot
A survey of information authentication
inferredcites →https://doi.org/10.1109/fscs.1990.89575openalex-snapshot
Simple construction of almost k-wise independent random variables
inferredcites →https://doi.org/10.1109/infcom.1992.263477openalex-snapshot
Message authentication with one-way hash functions
inferredcites →https://doi.org/10.1109/sfcs.1989.63450openalex-snapshot
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0217022openalex-snapshot
How to Construct Pseudorandom Permutations from Pseudorandom Functions
inferredcites →https://doi.org/10.1145/141809.141812openalex-snapshot
Message authentication with one-way hash functions
inferredcites →https://doi.org/10.1145/28395.28413openalex-snapshot
Efficiency considerations in using semi-random sources
inferredcites →https://doi.org/10.1145/78973.78978openalex-snapshot
Fast hashing of variable-length text strings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1764openalex-snapshot
Authenticated encryption: how reordering can impact performance
inferred← citeshttps://doi.org/10.1007/978-1-4419-8080-9_13openalex-snapshot
Memory Integrity Protection
inferred← citeshttps://doi.org/10.1007/978-3-319-06734-6_27openalex-snapshot
Universal Hash-Function Families: From Hashing to Authentication
inferred← citeshttps://doi.org/10.1007/978-3-319-70697-9_20openalex-snapshot
Analyzing Multi-key Security Degradation
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_29openalex-snapshot
A Message Authentication Code Based on Unimodular Matrix Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-03317-9_23openalex-snapshot
Fast and Secure CBC-Type MAC Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-24209-0_20openalex-snapshot
$\mathcal{E}$ -MACs: Towards More Secure and More Efficient Constructions of Secure Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-28496-0openalex-snapshot
Selected Areas in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-28496-0_14openalex-snapshot
Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3
inferred← citeshttps://doi.org/10.1007/978-3-642-31284-7_6openalex-snapshot
Authenticated Encryption: How Reordering Can Impact Performance
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_25openalex-snapshot
On the Minimum Number of Multiplications Necessary for Universal Hash Functions
inferred← citeshttps://doi.org/10.1007/s00145-020-09347-yopenalex-snapshot
Tight Security of Cascaded LRW2
inferred← citeshttps://doi.org/10.1007/s001450010009openalex-snapshot
CBC MAC for Real-Time Data Sources
inferred← citeshttps://doi.org/10.1007/s001459900051openalex-snapshot
How to Stretch Random Functions: The Security of Protected Counter Sums
inferred← citeshttps://doi.org/10.1007/s10623-010-9408-6openalex-snapshot
A trade-off between collision probability and key size in universal hashing using polynomials
inferred← citeshttps://doi.org/10.1007/s10623-012-9672-8openalex-snapshot
A new multi-linear universal hash family
inferred← citeshttps://doi.org/10.1007/s11128-024-04356-3openalex-snapshot
Secure mutual authentication quantum key agreement scheme for two-party setting with key recycling
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.009openalex-snapshot
The universality of iterated hashing over variable-length strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.008openalex-snapshot
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
inferred← citeshttps://doi.org/10.1088/1555-6611/ad2928openalex-snapshot
How many sessions of quantum key distribution are allowed from the first launch to the next restart of the system?
inferred← citeshttps://doi.org/10.1088/1612-202x/ac6a60openalex-snapshot
On the robustness of information-theoretic authentication in quantum cryptography
inferred← citeshttps://doi.org/10.1109/discex.2000.824971openalex-snapshot
Trading off strength and performance in network authentication: experience with the ACSA project
inferred← citeshttps://doi.org/10.1109/icc.2006.255126openalex-snapshot
Energy-Efficient Pipelined Bloom Filters for Network Intrusion Detection
inferred← citeshttps://doi.org/10.1109/iscas.2006.1692963openalex-snapshot
Increasing the power efficiency of Bloom filters for network string matching
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00131openalex-snapshot
CSIndex: A Coprocessor-Based Classified Secondary Index Mechanism for Efficient HBase Query
inferred← citeshttps://doi.org/10.1109/tc.2012.176openalex-snapshot
E-MACs: Toward More Secure and More Efficient Constructions of Secure Channels
inferred← citeshttps://doi.org/10.1109/tc.2017.2710125openalex-snapshot
A New Look at Counters: Don’t Run Like Marathon in a Hundred Meter Race
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3280561openalex-snapshot
An Information-Theoretic Secure Group Authentication Scheme for Quantum Key Distribution Networks
inferred← citeshttps://doi.org/10.1109/tit.2009.2027487openalex-snapshot
Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions
inferred← citeshttps://doi.org/10.1109/tit.2014.2317312openalex-snapshot
Key Recycling in Authentication
inferred← citeshttps://doi.org/10.1109/tit.2019.2925613openalex-snapshot
On Random Read Access in ${\mathsf{OCB}}$
inferred← citeshttps://doi.org/10.1134/s002136402460544xopenalex-snapshot
On the Key Search Complexity in Quantum Cryptography with Strong Information-Theoretic Authentication
inferred← citeshttps://doi.org/10.21928/juhd.20160203.24openalex-snapshot
Towards a Framework for Supporting Unconditionally Secure Authentication Services within E-Government Infrastructures
inferred← citeshttps://doi.org/10.3367/ufne.2025.07.039972openalex-snapshot
Vernam's, Kotelnikov's, and Shannon's one-time pad and quantum cryptography
inferred← citeshttps://doi.org/10.3367/ufnr.2025.07.039972openalex-snapshot
Vernam's, Kotelnikov's, and Shannon's one-time pad and quantum cryptography
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i3.130-150openalex-snapshot
Tight Security Analysis of EHtM MAC
inferred← citeshttps://doi.org/10.5281/zenodo.1083136openalex-snapshot
A Method Of Authentication For Quantum Networks
inferred← citeshttps://doi.org/10.70675/fa65e8c1z1f4bz4bc9zb73az5a5bf9600e74openalex-snapshot
Constructions pour la cryptographie à bas coût
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.