Pages that link to "Item:Q914645"

The following pages link to The combinatorics of authentication and secrecy codes (Q914645):

Displaying 40 items.

• Combinatorial bounds and characterizations of splitting authentication codes (Q601095) (← links)
• GOB designs for authentication codes with arbitration (Q851760) (← links)
• Information-theoretic bounds for authentication schemes (Q918497) (← links)
• Authentication codes and bipartite graphs (Q932829) (← links)
• New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
• Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes (Q1182412) (← links)
• Some highly symmetric authentication perpendicular arrays (Q1184512) (← links)
• Incidence structures applied to cryptography (Q1199628) (← links)
• Combinatorial characterizations of authentication codes (Q1200311) (← links)
• Construction of 2-designs (Q1288294) (← links)
• A lower bound on authentication after having observed a sequence of messages (Q1310451) (← links)
• A family of perpendicular arrays achieving perfect 4-fold secrecy (Q1322248) (← links)
• Universal hashing and authentication codes (Q1335421) (← links)
• Cartesian authentication codes from functions with optimal nonlinearity. (Q1401188) (← links)
• Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\). (Q1428519) (← links)
• A construction for optimal \(c\)-splitting authentication and secrecy codes (Q1650431) (← links)
• The uniformly 3-homogeneous subsets of PGL\((2,q)\) (Q1804245) (← links)
• On the construction of authentication and secrecy codes (Q1804982) (← links)
• Multireceiver authentication codes: Models, bounds, constructions, and extensions (Q1854288) (← links)
• Information-theoretic bounds for authentication codes and block designs (Q1903343) (← links)
• Authentication codes for nontrusting parties obtained from rank metric codes (Q1904420) (← links)
• Authentication codes in plaintext and chosen-content attacks (Q1910424) (← links)
• Association schemes based on singular symplectic geometry over finite fields and its application (Q1932625) (← links)
• On the equivalence of authentication codes and robust (2, 2)-threshold schemes (Q2033514) (← links)
• Large sets with multiplicity (Q2035460) (← links)
• Construction of authentication codes based on orthogonal array and Latin square (Q2140799) (← links)
• On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration (Q2324782) (← links)
• Subspaces in \(d\)-bounded distance-regular graphs and their applications (Q2426435) (← links)
• Algebraic manipulation detection codes (Q2438532) (← links)
• Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields (Q2439258) (← links)
• Combinational constructions of splitting authentication codes with perfect secrecy (Q2673993) (← links)
• ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION (Q2890985) (← links)
• Коды аутентификации с секретностью (обзор) (Q3381884) (← links)
• A TWOOA construction for multi-receiver multi-message authentication codes (Q3516764) (← links)
• Bounds And Constructions For Threshold Shared Generation Of Authenticators (Q4792963) (← links)
• Isomorphism classes of authentication codes (Q4824807) (← links)
• (Q5150574) (← links)
• Quantum Authentication with Key Recycling (Q5270367) (← links)
• Broadcast authentication for group communication (Q5958610) (← links)
• Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes (Q6047434) (← links)