Almost \(k\)-wise independent sample spaces and their cryptologic applications

DOI10.1007/s00145-001-0010-yzbMath1008.94017OpenAlexW1809690300MaRDI QIDQ5950639

Douglas R. Stinson, Thomas Johansson, Kaoru Kurosawa

Publication date: 2 January 2002

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-001-0010-y

zbMATH Keywords

cryptographypseudorandom functionsorthogonal arrayalmost \(k\)-wise independent sample spacesalmost resilient functionsauthentication codesbiased arrayslinear error-correcting codeuniversal hash functions

Mathematics Subject Classification ID

Cryptography (94A60) Foundations of probability theory (60A99) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Variation on correlation immune Boolean and vectorial functions ⋮ Deterministic Massively Parallel Connectivity ⋮ Component stability in low-space massively parallel computation ⋮ Locating and detecting arrays for interaction faults ⋮ On possible dependence structures of a set of random variables ⋮ A quantum algorithm for testing and learning resiliency of a Boolean function ⋮ Quantum algorithms for the resiliency of vectorial Boolean functions ⋮ Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification

This page was built for publication: Almost \(k\)-wise independent sample spaces and their cryptologic applications