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 …
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 …
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 …
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 …
A unique overview of network security issues, solutions, and methodologies at an architectural and research level Network Security provides the latest research and …
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 …
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 …
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 …