Universal classes of hash functions

Cites work

A Fast Monte-Carlo Test for Primality
scientific article; zbMATH DE number 3709574 (Why is no real title available?)
scientific article; zbMATH DE number 3709575 (Why is no real title available?)
scientific article; zbMATH DE number 3473265 (Why is no real title available?)
scientific article; zbMATH DE number 3557236 (Why is no real title available?)
scientific article; zbMATH DE number 3596285 (Why is no real title available?)
scientific article; zbMATH DE number 3597592 (Why is no real title available?)
scientific article; zbMATH DE number 3449757 (Why is no real title available?)

Cited in

(only showing first 100 items - show all)

Hierarchical sampling from sketches: Estimating functions over data streams
Approximate colored range and point enclosure queries
Encryption modes with almost free message integrity
Reducing complexity assumptions for statistically-hiding commitment
On the impossibility of highly-efficient blockcipher-based hash functions
New approaches for deniable authentication
A probabilistic distributed algorithm for set intersection and its analysis
NP is as easy as detecting unique solutions
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
The generation of random permutations on the fly
Graph isomorphism is in the low hierarchy
On the power of two-point based sampling
A note on universal classes of hash functions
New hash functions and their use in authentication and set equality
On the theory of average case complexity
Pseudorandom generators for space-bounded computation
The computational complexity of universal hashing
Clocked adversaries for hashing
On hiding information from an oracle
Sorting in linear time?
Approximating hyper-rectangles: Learning and pseudorandom sets
\(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
Reliable communication over partially authenticated networks
Finding extremal sets in less than quadratic time
Randomness in interactive proofs
Provably good pattern generators for a random pattern test
\(\text{RL}\subseteq \text{SC}\)
Combinatorial techniques for universal hashing
Algorithms for parallel memory, I: Two-level memories
Locality-preserving hash functions for general purpose parallel computation
Universal hashing and authentication codes
Locating P/poly optimally in the extended low hierarchy
A theory for memory-based learning
A fast randomized LOGSPACE algorithm for graph connectivity
Linking information reconciliation and privacy amplification
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
Exploiting storage redundancy to speed up randomized shared memory simulations
Simulating shared memory in real time: On the computation power of reconfigurable architectures
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Perfect hashing
Approximation algorithms for multiple sequence alignment
Optimal proof systems imply complete sets for promise classes
The effect of side-information on smooth entropy.
Non-cryptographic primitive for pseudorandom permutation.
Min-wise independent permutations
Protocols for asymmetric communication channels
Quantum algorithms for the \(k\)-XOR problem
Simple and more efficient PRFs with tight security from LWE and matrix-DDH
Evaluating Bernstein-Rabin-Winograd polynomials
On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
The optimal size of a signature
Proving properties of interactive proofs by a generalized counting technique
Optimal bounds for the predecessor problem and related problems
Mathematical problems in cryptology
Simulating BPP using a general weak random source
Efficient PRAM simulation on a distributed memory machine
Secure two-party computation via cut-and-choose oblivious transfer
On the (im-)possibility of extending coin toss
Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
The circulant hash revisited
Approximation in (poly-) logarithmic space
Revisiting construction of online cipher in hash-ECB-hash structure
Error correction in quantum cryptography based on artificial neural networks
Quantum key distribution using universal hash functions over finite fields
A generic construction of fuzzy signature
Cryptanalysis and improvement in multi-party quantum key distribution protocol with new Bell states encoding mode
Bounds on the efficiency of black-box commitment schemes
A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
On the relationship between statistical zero-knowledge and statistical randomized encodings
Key establishment à la Merkle in a quantum world
From non-adaptive to adaptive pseudorandom functions
Efficiently correcting matrix products
Hardness-preserving reductions via cuckoo hashing
In search of mathematical primitives for deriving universal projective hash families
Entanglement of the antisymmetric state
One-way protocol for two-bit intrinsic random key distribution with entangled photon pairs
A trade-off between collision probability and key size in universal hashing using polynomials
Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
A new interactive hashing theorem
Asymmetric ``4+2 protocol for quantum key distribution with finite resources
Authenticating ad hoc networks by comparison of short digests
Error-bounded probabilistic computations between MA and AM
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Pseudorandom generators from regular one-way functions: new constructions with improved parameters
Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker
On the complexity of constructing pseudorandom functions (especially when they don't exist)
MRD hashing.
Bounds on the OBDD-size of integer multiplication via universal hashing
New techniques and tighter bounds for local computation algorithms
Attacks on quantum key distribution protocols that employ non-ITS authentication
Measure-resend authenticated semi-quantum key distribution with single photons
Optimizing the decoy-state BB84 QKD protocol parameters
Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
Towards closing the security gap of Tweak-aNd-Tweak (TNT)
MMH* with arbitrary modulus is always almost-universal
The smooth entropy formalism for von Neumann algebras
Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch
Breaking symmetric cryptosystems using quantum period finding
On the relationship between statistical zero-knowledge and statistical randomized encodings
Recognizing Hamming graphs in linear time and space

This page was built for publication: Universal classes of hash functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259907)