Results 11 to 20 of about 93,599 (182)
Forgery Attacks on Several Beyond-Birthday-Bound Secure MACs
Lecture Notes in Computer Science, 2023 At CRYPTO’18, Datta et al. proposed nPolyMAC and proved the security up to 22𝑛/3 authentication queries and 2𝑛 verification queries. At EUROCRYPT’19, Dutta et al. proposed CWC+ and showed the se- curity up to 22𝑛/3 queries. At FSE’19, Datta et al. proposed PolyMAC and its key-reduced variant 2k-PolyMAC, and showed the security up to 22𝑛/3 queries. This
Shen, Yaobin +3 more
openaire +4 more sources
Permutation Based EDM: An Inverse Free BBB Secure PRF
IACR Transactions on Symmetric Cryptology, 2021 In CRYPTO 2019, Chen et al. have initiated an interesting research direction in designing PRF based on public permutations. They have proposed two beyond the birthday bound secure n-bit to n-bit PRF constructions, i.e., SoEM22 and SoKAC21, which are ...
Avijit Dutta +2 more
doaj +1 more source
Children &Society, EarlyView., 2023 Abstract Applying social interdependence theory as a framework for document analysis, this paper considers eight evaluations of an extended care scheme in England known as ‘Staying Close’. Findings suggest that for extended care projects like ‘Staying Close’ to work, any service offer designed to support the transition from residential care to ...
Dan Allen
wiley +1 more source
Iterative Block Ciphers from Tweakable Block Ciphers with Long Tweaks
IACR Transactions on Symmetric Cryptology, 2020 We consider a problem of constructing a secure block cipher from a tweakable block cipher (TBC) with long tweaks. Given a TBC with n-bit blocks and Γn-bit tweaks for Γ ≥ 1, one of the constructions by Minematsu in DCC 2015 shows that a simple iteration ...
Ryota Nakamichi, Tetsu Iwata
doaj +1 more source
Generalized Feistel Structures Based on Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2022 A generalized Feistel structure (GFS) is a classical approach to construct a block cipher from pseudorandom functions (PRFs). Coron et al. at TCC 2010 instantiated a Feistel structure with a tweakable block cipher (TBC), and presented its provable ...
Kazuki Nakaya, Tetsu Iwata
doaj +1 more source
Tweakable Blockciphers with Beyond Birthday-Bound Security [PDF]
, 2012 Liskov, Rivest and Wagner formalized the tweakable blockcipher TBC primitive at CRYPTO'02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then build up a construction that admits a tweak. Almost all such constructions enjoy provable security only to the birthday bound, and the one that does achieve security beyond the ...
Will Landecker +2 more
openaire +1 more source
Tight Security Analysis of EHtM MAC
IACR Transactions on Symmetric Cryptology, 2017 The security of a probabilistic Message Authentication Code (MAC) usually depends on the uniqueness of the random salt which restricts the security to birthday bound of the salt size due to the collision on random salts (e.g XMACR).
Avijit Dutta, Ashwin Jha, Mridul Nandi
doaj +1 more source
AES-LBBB: AES Mode for Lightweight and BBB-Secure Authenticated Encryption
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, a new lightweight authenticated encryption scheme AESLBBB is proposed, which was designed to provide backward compatibility with advanced encryption standard (AES) as well as high security and low memory.
Yusuke Naito +2 more
doaj +1 more source
Proactive detection of DDOS attacks in Publish-Subscribe networks [PDF]
, 2016 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]
, 2011 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