Pages that link to "Item:Q1259907"
From MaRDI portal
The following pages link to Universal classes of hash functions (Q1259907):
Displaying 50 items.
- Attacks on quantum key distribution protocols that employ non-ITS authentication (Q265393) (← links)
- MMH* with arbitrary modulus is always almost-universal (Q269733) (← links)
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Study on the security of the authentication scheme with key recycling in QKD (Q331437) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- A new multi-linear universal hash family (Q369419) (← links)
- On the relationships between perfect nonlinear functions and universal hash families (Q391979) (← links)
- The universality of iterated hashing over variable-length strings (Q412371) (← links)
- Low-contention data structures (Q433458) (← links)
- A new multistage approach to detect subtle DDoS attacks (Q445392) (← links)
- Structures and lower bounds for binary covering arrays (Q449145) (← links)
- Revisiting iterated attacks in the context of decorrelation theory (Q458736) (← links)
- Cache-oblivious hashing (Q472489) (← links)
- Using quantum key distribution for cryptographic purposes: a survey (Q477173) (← links)
- Direct proof of security of Wegman-Carter authentication with partially known key (Q479440) (← links)
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- A practical protocol for three-party authenticated quantum key distribution (Q488178) (← links)
- Boosting distinct random sampling for basic counting on the union of distributed streams (Q497679) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations (Q626960) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- Sharp lower bounds on the extractable randomness from non-uniform sources (Q719242) (← links)
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting (Q748223) (← links)
- A caution on universal classes of hash functions (Q751240) (← links)
- On the complexity of counting in the polynomial hierarchy (Q808260) (← links)
- How to emulate shared memory (Q808683) (← links)
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields (Q832844) (← links)
- Variationally universal hashing (Q845822) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- A derandomization using min-wise independent permutations (Q876688) (← links)
- A note on local randomness in polynomial random number and random function generators (Q884595) (← links)
- Efficient bit sifting scheme of post-processing in quantum key distribution (Q892640) (← links)
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model (Q893865) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- New proofs for NMAC and HMAC: security without collision resistance (Q901373) (← links)
- Universal hash functions for an infinite universe and hash trees (Q987792) (← links)
- Hierarchical sampling from sketches: Estimating functions over data streams (Q1016526) (← links)
- Approximate colored range and point enclosure queries (Q1018093) (← links)
- Encryption modes with almost free message integrity (Q1021243) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- On the impossibility of highly-efficient blockcipher-based hash functions (Q1027986) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
