The following pages link to (Q3783202):
Displaying 15 items.
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration (Q914647) (← links)
- Authentication codes and bipartite graphs (Q932829) (← links)
- Some constructions and bounds for authentication codes (Q1109006) (← links)
- Combinatorial characterizations of authentication codes (Q1200311) (← links)
- On the construction of authentication and secrecy codes (Q1804982) (← links)
- Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication (Q2790048) (← links)
- (Q3071763) (← links)
- (Q3500873) (← links)
- General lower bounds for chosen-content attacks against authentication codes (Q4223765) (← links)
- (Q4249338) (← links)
- Linear authentication codes: bounds and constructions (Q4680057) (← links)
- (Q4862224) (← links)
- Message Authentication with Arbitration of Transmitter/Receiver Disputes (Q5000238) (← links)
- (Q5284086) (← links)
- New bound for affine resolvable designs and its application to authentication codes (Q6085716) (← links)