The following pages link to Colin A. Boyd (Q1872782):
Displaying 50 items.
- (Q826056) (redirect page) (← links)
- (Q1228494) (redirect page) (← links)
- Designing secure key exchange protocols (Q826057) (← links)
- On strengthening authentication protocols to foil cryptanalysis (Q826064) (← links)
- A novel nonrepudiable threshold multi-proxy multi-signature scheme with shared verification (Q1013325) (← links)
- Identity-based strong designated verifier signature schemes: attacks and new construction (Q1013330) (← links)
- One-round key exchange in the standard model (Q1017542) (← links)
- Designing a secure e-tender submission protocol (Q1020561) (← links)
- Residuation in semigroups of pre-closures (Q1228495) (← links)
- Security notions for cloud storage and deduplication (Q1616678) (← links)
- Protocols for authentification and key establishment (Q1872784) (← links)
- Fast and secure updatable encryption (Q2096496) (← links)
- A blind coupon mechanism enabling veto voting over unreliable networks (Q2179393) (← links)
- Secure channels and termination: the last word on TLS (Q2303094) (← links)
- Key recovery: inert and public (Q2412219) (← links)
- Modular proofs for key exchange: rigorous optimizations in the Canetti-Krawczyk model (Q2502168) (← links)
- A public key cryptosystem based on a subgroup membership problem (Q2572970) (← links)
- (Q2707402) (← links)
- (Q2721130) (← links)
- (Q2721133) (← links)
- (Q2721171) (← links)
- (Q2762904) (← links)
- From Stateless to Stateful: Generic Authentication and Authenticated Encryption Constructions with Application to TLS (Q2799006) (← links)
- Effort-Release Public-Key Encryption from Cryptographic Puzzles (Q2907372) (← links)
- Minimizing Information Leakage of Tree-Based RFID Authentication Protocols Using Alternate Tree-Walking (Q2907393) (← links)
- ASICS: Authenticated Key Exchange Security Incorporating Certification Systems (Q2925565) (← links)
- (Q3043930) (← links)
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (Q3073713) (← links)
- On Forward Secrecy in One-Round Key Exchange (Q3104714) (← links)
- Towards a Provably Secure DoS-Resilient Key Exchange Protocol with Perfect Forward Secrecy (Q3104755) (← links)
- (Q3149707) (← links)
- (Q3149750) (← links)
- Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection (Q3166828) (← links)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
- Strongly Secure Certificateless Key Agreement (Q3392914) (← links)
- Continuous After-the-Fact Leakage-Resilient eCK-Secure Key Exchange (Q3460112) (← links)
- Efficient One-Round Key Exchange in the Standard Model (Q3511152) (← links)
- (Q3512572) (← links)
- Avoiding Full Extension Field Arithmetic in Pairing Computations (Q3558313) (← links)
- Generic One Round Group Key Exchange in the Standard Model (Q3578256) (← links)
- Efficient Certificateless KEM in the Standard Model (Q3578258) (← links)
- Delaying Mismatched Field Multiplications in Pairing Computations (Q3578474) (← links)
- Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols (Q3617516) (← links)
- On the structure of the family of Cherry fields on the torus (Q3700485) (← links)
- (Q3778801) (← links)
- (Q3839194) (← links)
- (Q4011767) (← links)
- Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects (Q4037471) (← links)
- (Q4084916) (← links)
- (Q4249272) (← links)
- (Q4250627) (← links)
