Results 31 to 40 of about 44,375 (171)
The Definition and Software Performance of Hashstream, a Fast Length-Flexible PRF
Cryptography, 2018 Two of the fastest types of cryptographic algorithms are the stream cipher and the almost-universal hash function. There are secure examples of each that process data in software using less than one CPU cycle per byte.
Ted Krovetz
doaj +1 more source
On the Gold Standard for Security of Universal Steganography [PDF]
, 2018 While symmetric-key steganography is quite well understood both in the information-theoretic and in the computational setting, many fundamental questions about its public-key counterpart resist persistent attempts to solve them.
A Kiayias +30 more
core +2 more sources
IACR Transactions on Symmetric Cryptology, 2017 This paper introduces QARMA, a new family of lightweight tweakable block ciphers targeted at applications such as memory encryption, the generation of very short tags for hardware-assisted prevention of software exploitation, and the construction of ...
Roberto Avanzi
doaj +1 more source
Leftover Hashing Against Quantum Side Information
, 2010 The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random.
Renner, Renato +3 more
core +1 more source
Linear probing with constant independence [PDF]
, 2007 Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous
Anna Pagh, Milan Ruzic, Rasmus Pagh
core +1 more source
More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
, 2015 We explicitly construct random hash functions for privacy amplification (extractors) that require smaller random seed lengths than the previous literature, and still allow efficient implementations with complexity $O(n\log n)$ for input length $n$.
Hayashi, Masahito, Tsurumaru, Toyohiro
core +1 more source
Using Transposition Padding to Get CCA2 Security From Any Deterministic Encryption Schemes
IEEE Access, 2019 We study how to make any deterministic encryption scheme probabilistic and secure against adaptively chosen ciphertext attacks. A new transpositional padding encryption scheme is proposed, with which we construct a universal scheme, namely, a ...
Linming Gong +4 more
doaj +1 more source
Dual Universality of Hash Functions and Its Applications to Quantum Cryptography [PDF]
IEEE Transactions on Information Theory, 2013 In this paper, we introduce the concept of dual universality of hash functions and present its applications to quantum cryptography. We begin by establishing the one-to-one correspondence between a linear function family {\cal F} and a code family {\cal C}, and thereby defining \varepsilon-almost dual universal_2 hash functions, as a generalization of ...
Toyohiro Tsurumaru, Masahito Hayashi
openaire +2 more sources
COST BENEFIT ANALYSIS OF COMPROMISING LEDGER SYSTEM BASED ON BLOCKCHAIN TECHNOLOGY
BizInfo, 2018 Modern application of the blockchain technology is the center of attention of technology and economy sectors. Proper usage of blockchain is based on peer to peer (P2P) network to coordinate a worldwide, universal ledger where all transactions on the ...
Edis Mekić +2 more
doaj +1 more source
Key recycling in authentication
, 2014 In their seminal work on authentication, Wegman and Carter propose that to authenticate multiple messages, it is sufficient to reuse the same hash function as long as each tag is encrypted with a one-time pad.
Portmann, Christopher
core +1 more source