The following pages link to (Q5187321):
Displaying 15 items.
- Combinatorial bounds and characterizations of splitting authentication codes (Q601095) (← links)
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups (Q909643) (← links)
- The combinatorics of authentication and secrecy codes (Q914645) (← links)
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration (Q914647) (← links)
- Commitment and authentication systems (Q1039270) (← links)
- Some constructions and bounds for authentication codes (Q1109006) (← links)
- A construction for authentication/secrecy codes from certain combinatorial designs (Q1112007) (← links)
- New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
- Incidence structures applied to cryptography (Q1199628) (← links)
- Combinatorial characterizations of authentication codes (Q1200311) (← links)
- A lower bound on authentication after having observed a sequence of messages (Q1310451) (← links)
- Constructions of difference covering arrays. (Q1421336) (← links)
- A construction for optimal \(c\)-splitting authentication and secrecy codes (Q1650431) (← links)
- Combinational constructions of splitting authentication codes with perfect secrecy (Q2673993) (← links)
- Message Authentication with Arbitration of Transmitter/Receiver Disputes (Q5000238) (← links)
