Results 21 to 30 of about 93,608 (187)
Proactive detection of DDOS attacks in Publish-Subscribe networks [PDF]
Information centric networking (ICN) using architectures such as Publish-Subscribe Internet Routing Paradigm (PSIRP) or Publish-Subscribe Internet Technology (PURSUIT) has been proposed as an important candidate for the Internet of the future.
Alarfaj, Fawaz +4 more
core +2 more sources
Random Oracles in a Quantum World [PDF]
The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems.
C.H. Bennett +25 more
core +3 more sources
Security of the Misty Structure beyond the Birthday Bound [PDF]
In this paper, we first prove beyond-birthyday-bound security for the Misty structure. Specifically, we show that an r-round Misty structure is secure against CCA attacks up to O(2 rn r+7 ) query complexity, where n is the size of each round permutation.
openaire +1 more source
LM-DAE: Low-Memory Deterministic Authenticated Encryption for 128-bit Security
This paper proposes a new lightweight deterministic authenticated encryption (DAE) scheme providing 128-bit security. Lightweight DAE schemes are practically important because resource-restricted devices sometimes cannot afford to manage a nonce properly.
Yusuke Naito +2 more
doaj +3 more sources
On the Composition of Single-Keyed Tweakable Even-Mansour for Achieving BBB Security
Observing the growing popularity of random permutation (RP)-based designs (e.g, Sponge), Bart Mennink in CRYPTO 2019 has initiated an interesting research in the direction of RP-based pseudorandom functions (PRFs).
Avik Chakraborti +3 more
doaj +1 more source
This paper is a tribute to José Meseguer, from the rest of us in the Maude team, reviewing the past, the present, and the future of the language and system with which we have been working for around two decades under his leadership.
Clavel, Manuel +6 more
core +1 more source
Improved Security Bound of (E/D)WCDM
In CRYPTO’16, Cogliati and Seurin proposed a block cipher based nonce based MAC, called Encrypted Wegman-Carter with Davies-Meyer (EWCDM), that gives 2n/3 bit MAC security in the nonce respecting setting and n/2 bit security in the nonce misuse setting ...
Nilanjan Datta +2 more
doaj +1 more source
Single Key Variant of PMAC_Plus
At CRYPTO 2011, Yasuda proposed the PMAC_Plus message authentication code based on an n-bit block cipher. Its design principle inherits the well known PMAC parallel network with a low additional cost.
Nilanjan Datta +4 more
doaj +1 more source
Efficient Side-Channel Secure Message Authentication with Better Bounds
We investigate constructing message authentication schemes from symmetric cryptographic primitives, with the goal of achieving security when most intermediate values during tag computation and verification are leaked (i.e., mode-level leakage-resilience).
Chun Guo +3 more
doaj +1 more source
Lightweight Authenticated Encryption Mode of Operation for Tweakable Block Ciphers
The use of a small block length is a common strategy when designing lightweight (tweakable) block ciphers (TBCs), and several 64-bit primitives have been proposed.
Yusuke Naito, Takeshi Sugawara
doaj +1 more source

