Surnaming Schemes, Fast Verification, and Applications to SGX Technology

DOI10.1007/978-3-319-52153-4_9zbMath1383.94013OpenAlexW2570587891MaRDI QIDQ2975802

Shay Gueron, Dan Boneh

Publication date: 12 April 2017

Published in: Topics in Cryptology – CT-RSA 2017 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-52153-4_9

zbMATH Keywords

digital signaturesfast verificationpost-quantum secure signaturesSoftware Guard Extensions (SGX) technology

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Surnaming Schemes, Fast Verification, and Applications to SGX Technology

Cites Work

• Unnamed Item
• Unnamed Item
• Short signatures from the Weil pairing
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• SPHINCS: Practical Stateless Hash-Based Signatures
• Simpira v2: A Family of Efficient Permutations Using the AES Round Function
• Surnaming Schemes, Fast Verification, and Applications to SGX Technology
• On the Security of the Winternitz One-Time Signature Scheme
• Strengthening Digital Signatures Via Randomized Hashing

This page was built for publication: Surnaming Schemes, Fast Verification, and Applications to SGX Technology