The SPHINCS+ Signature Framework

DJ Bernstein, A Hülsing, S Kölbl… - Proceedings of the …, 2019 - dl.acm.org
We introduce SPHINCS+, a stateless hash-based signature framework. SPHINCS+ has
significant advantages over the state of the art in terms of speed, signature size, and …

[图书][B] Handbook of applied cryptography

AJ Menezes, PC Van Oorschot, SA Vanstone - 2018 - taylorfrancis.com
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an
important discipline that is not only the subject of an enormous amount of research, but …

[PS][PS] Practical byzantine fault tolerance

M Castro, B Liskov - OsDI, 1999 - usenix.org
This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We
believe that Byzantinefault-tolerant algorithms will be increasingly important in the future …

Practical byzantine fault tolerance and proactive recovery

M Castro, B Liskov - ACM Transactions on Computer Systems (TOCS), 2002 - dl.acm.org
Our growing reliance on online services accessible on the Internet demands highly
available systems that provide correct service without interruptions. Software bugs, operator …

[HTML][HTML] HMAC: Keyed-hashing for message authentication

H Krawczyk, M Bellare, R Canetti - 1997 - rfc-editor.org
RFC 2104: HMAC: Keyed-Hashing for Message Authentication [RFC Home] [TEXT|PDF|HTML]
[Tracker] [IPR] [Errata] [Info page] INFORMATIONAL Updated by: 6151 Errata Exist Network …

Keying hash functions for message authentication

M Bellare, R Canetti, H Krawczyk - … Barbara, California, USA August 18–22 …, 1996 - Springer
The use of cryptographic hash functions like MD5 or SHA-1 for message authentication has
become a standard approach in many applications, particularly Internet security protocols …

Network security: current status and future directions

C Douligeris, DN Serpanos - 2007 - books.google.com
A unique overview of network security issues, solutions, and methodologies at an
architectural and research level Network Security provides the latest research and …

A secure and optimally efficient multi‐authority election scheme

R Cramer, R Gennaro… - European transactions on …, 1997 - Wiley Online Library
In this paper we present a new multi‐authority secret‐ballot election scheme that guarantees
privacy, universal veriability, and robustness. It is the first scheme for which the performance …

Chaskey: an efficient MAC algorithm for 32-bit microcontrollers

N Mouha, B Mennink, A Van Herrewege… - Selected Areas in …, 2014 - Springer
We propose Chaskey: a very efficient Message Authentication Code (MAC) algorithm for 32-
bit microcontrollers. It is intended for applications that require 128-bit security, yet cannot …

The security of the cipher block chaining message authentication code

M Bellare, J Kilian, P Rogaway - Journal of Computer and System …, 2000 - Elsevier
Let F be some block cipher (eg., DES) with block length l. The cipher block chaining
message authentication code (CBC MAC) specifies that an m-block message x= x1… xm be …