Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
From MaRDI portal
Publication:5261641
DOI10.1007/978-3-662-46494-6_20zbMath1354.94056OpenAlexW2116018059MaRDI QIDQ5261641
Ronald Cramer, Carles Padró, Xing, Chaoping
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10356/81331
algebraic manipulation detection (AMD) codesconstant error probabilityunbounded cardinality of message space
Cryptography (94A60) Other types of codes (94B60) Authentication, digital signatures and secret sharing (94A62)
Related Items (13)
Construction and nonexistence of strong external difference families ⋮ Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions ⋮ Disjoint difference families and their applications ⋮ Weighted external difference families and R-optimal AMD codes ⋮ Nonexistence of strong external difference families in abelian groups of order being product of at most three primes ⋮ New existence and nonexistence results for strong external difference families ⋮ Nearly optimal robust secret sharing ⋮ Optimal Computational Split-state Non-malleable Codes ⋮ Algebraic manipulation detection codes via highly nonlinear functions ⋮ Some results on generalized strong external difference families ⋮ Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families ⋮ The asymptotic behavior of automorphism groups of function fields over finite fields ⋮ On optimal weak algebraic manipulation detection codes and weighted external difference families
This page was built for publication: Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
