Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/b97182zbMath1122.94423OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307268

Eyal Kushilevitz, Yuval Ishai

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97182

Mathematics Subject Classification ID

Information theory (general) (94A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ High-throughput secure three-party computation with an honest majority ⋮ Improved single-round secure multiplication using regenerating codes ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ On actively-secure elementary MPC reductions ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ On privacy and partition arguments ⋮ Some Open Problems in Information-Theoretic Cryptography

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004