The following pages link to Codes Which Detect Deception (Q4401320):
Displaying 32 items.
- A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields (Q2254537) (← links)
- A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields (Q2336118) (← links)
- Several Anzahl theorems of alternate matrices over Galois rings (Q2341822) (← links)
- A new construction of multisender authentication codes from polynomials over finite fields (Q2375496) (← links)
- A survey on fast correlation attacks (Q2376656) (← links)
- A trade-off between collision probability and key size in universal hashing using polynomials (Q2430412) (← links)
- A class of authentication codes with secrecy (Q2430699) (← links)
- Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields (Q2439258) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- What is the Future of Cryptography? (Q2803620) (← links)
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC (Q2835585) (← links)
- Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields (Q2862507) (← links)
- ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION (Q2890985) (← links)
- On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes (Q2946883) (← links)
- Коды аутентификации с секретностью (обзор) (Q3381884) (← links)
- Universal Hashing and Multiple Authentication (Q3452336) (← links)
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings (Q3452337) (← links)
- On Fast and Provably Secure Message Authentication Based on Universal Hashing (Q3452360) (← links)
- General lower bounds for chosen-content attacks against authentication codes (Q4223765) (← links)
- Authentication codes: An area where coding and cryptology meet (Q4608509) (← links)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (Q4640336) (← links)
- Essentially<i>s</i>-fold secure authentication systems of level<i>l</i> (Q4792935) (← links)
- Bounds And Constructions For Threshold Shared Generation Of Authenticators (Q4792963) (← links)
- Cryptanalysis of Secure Message Transmission Protocols with Feedback (Q4931676) (← links)
- Message Authentication with Arbitration of Transmitter/Receiver Disputes (Q5000238) (← links)
- On the Security of Compressed Encodings (Q5019335) (← links)
- Unconditional Byzantine agreement for any number of faulty processors (Q5096793) (← links)
- (Q5150574) (← links)
- Unconditionally Secure Approximate Message Authentication (Q5323012) (← links)
- On Efficient Message Authentication Via Block Cipher Design Techniques (Q5387102) (← links)
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk) (Q5502804) (← links)
- Economically Optimal Variable Tag Length Message Authentication (Q5854434) (← links)
