Pages that link to "Item:Q1304974"
From MaRDI portal
The following pages link to On a fallacious bound for authentication codes (Q1304974):
Displaying 14 items.
- Lower bounds for robust secret sharing schemes (Q287197) (← links)
- Some new classes of 2-fold optimal or perfect splitting authentication codes (Q507956) (← links)
- A new class of splitting 3-designs (Q548095) (← links)
- Combinatorial bounds and characterizations of splitting authentication codes (Q601095) (← links)
- Disjoint difference families and their applications (Q908044) (← links)
- Some constructions and bounds for authentication codes (Q1109006) (← links)
- New combinatorial designs and their applications to authentication codes and secret sharing schemes. (Q1428540) (← links)
- A construction for optimal \(c\)-splitting authentication and secrecy codes (Q1650431) (← links)
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes (Q2033514) (← links)
- Combinational constructions of splitting authentication codes with perfect secrecy (Q2673993) (← links)
- Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication (Q2790048) (← links)
- (Q3783202) (← links)
- General lower bounds for chosen-content attacks against authentication codes (Q4223765) (← links)
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes (Q6047434) (← links)