Pairings in Trusted Computing

DOI10.1007/978-3-540-85538-5_1zbMath1186.94431OpenAlexW1577950161MaRDI QIDQ3600490

Liqun Chen, P. Morrissey, Nigel P. Smart

Publication date: 10 February 2009

Published in: Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_1

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (4)

EPID with malicious revocation ⋮ A Static Diffie-Hellman Attack on Several Direct Anonymous Attestation Schemes ⋮ A note on the Chen-Morrissey-Smart DAA scheme ⋮ On Proofs of Security for DAA Schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairings for cryptographers
• The Eta Pairing Revisited
• Reducing elliptic curve logarithms to logarithms in a finite field
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• A Direct Anonymous Attestation Scheme for Embedded Devices

This page was built for publication: Pairings in Trusted Computing