Beyond Modes: Building a Secure Record Protocol from a Cryptographic Sponge Permutation

Saarinen, Markku–Juhani O.

doi:10.1007/978-3-319-04852-9_14

Cited by 15 publications

(16 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, the mode is similar to SpongeWrap [19], though using a slightly more involved domain separation system similar to the one of NORX. Due to above observations, our proof readily generalizes to BLNK [82], and thus to CBEAM and STRIBOB.…”

Section: Blnk (Cbeam and Stribob)mentioning

confidence: 65%

See 1 more Smart Citation

Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes

et al. 2018

View full text Add to dashboard Cite

Abstract. The Sponge function is known to achieve 2 c/2 security, where c is its capacity. This bound was carried over to its keyed variants, such as SpongeWrap, to achieve a min{2 c/2 , 2 κ } security bound, with κ the key length. Similarly, many CAESAR competition submissions were designed to comply with the classical 2 c/2 security bound. We show that Sponge-based constructions for authenticated encryption can achieve the significantly higher bound of min{2 b/2 , 2 c , 2 κ }, with b > c the permutation size, by proving that the CAESAR submission NORX achieves this bound. The proof relies on rigorous computation of multi-collision probabilities, which may be of independent interest. We additionally derive a generic attack based on multi-collisions that matches the bound. We show how to apply the proof to five other Sponge-based CAESAR submissions: Ascon, CBEAM/STRIBOB, ICEPOLE, Keyak, and two out of the three PRIMATEs. A direct application of the result shows that the parameter choices of some of these submissions are overly conservative. Simple tweaks render the schemes considerably more efficient without sacrificing security. We finally consider the remaining one of the three PRIMATEs, APE, and derive a blockwise adaptive attack in the noncerespecting setting with complexity 2 c/2 , therewith demonstrating that the techniques cannot be applied to APE.

show abstract

Section: Blnk (Cbeam and Stribob)mentioning

confidence: 65%

“…Minaud identified an attack on CBEAM [62], but we focus on the modes of operation. Both modes are based on the BLNK Sponge mode [82], which is depicted in Fig. 4b.…”

Section: Blnk (Cbeam and Stribob)mentioning

confidence: 99%

Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes

et al. 2018

View full text Add to dashboard Cite

show abstract

“…A special padding mode of operation, BLINKER [23], is proposed together with CBEAM. This multi-use padding mode allows full encryption protocols to be built from CBEAM.…”

Section: Padding and Implementation Notesmentioning

confidence: 99%

CBEAM: Efficient Authenticated Encryption from Feebly One-Way ϕ Functions

Saarinen

2014

Topics in Cryptology – CT-RSA 2014

Self Cite

View full text Add to dashboard Cite

Abstract. We show how efficient and secure cryptographic mixing functions can be constructed from low-degree rotation-invariant φ functions rather than conventional S-Boxes. These novel functions have surprising properties; many exhibit inherent feeble (Boolean circuit) one-wayness and offer speed/area tradeoffs unobtainable with traditional constructs. Recent theoretical results indicate that even if the inverse is not explicitly computed in an implementation, its degree plays a fundamental role to the security of the iterated composition. To illustrate these properties, we present CBEAM, a Cryptographic Sponge Permutation based on a single 5 × 1-bit Boolean function. This simple nonlinear function is used to construct a 16-bit rotation-invariant φ function of Degree 4 (but with a very complex Degree 11 inverse), which in turn is expanded into an efficient 256-bit mixing function. In addition to flexible tradeoffs in hardware we show that efficient implementation strategies exist for software platforms ranging from low-end microcontrollers to the very latest x86-64 AVX2 instruction set. A rotational bit-sliced software implementation offers not only comparable speeds to AES but also increased security against cache side channel attacks. Our construction supports Sponge-based Authenticated Encryption, Hashing, and PRF/PRNG modes and is highly useful as a compact "all-in-one" primitive for pervasive security.

show abstract

“…The sponge function π is operated in a MULTIPLEX-like mode in order to achieve maximum flexibility [27]. This way STRIBOB may be used for plain hashing, PRNG generation and in two-party protocols in addition to Authenticated Encryption with Associated Data (AEAD).…”

Section: Sponge Mode and Security Parametersmentioning

confidence: 99%

“…This has clear advantages for performance and implementation footprint, which are especially useful in limited-resource applications. Even full-featured secure communications suites may be constructed from a single permutation [27].…”

Section: Introductionmentioning

confidence: 99%

StriBob: authenticated encryption from GOST R 34.11-2012 LPS permutation

Сааринен¹,

Saarinen²

2015

Матем. вопр. криптогр.

View full text Add to dashboard Cite

Authenticated encryption algorithms protect both the confidentiality and integrity of messages in a single processing pass. We show how to utilize the L • P • S transform of the Russian GOST R 34.11-2012 standard hash «Streebog» to construct an efficient, lightweight algorithm for Authenticated Encryption with Associated Data (AEAD) via the Sponge scheme. The proposed algorithm "StriBob" has attractive security properties, is faster than the Streebog hash alone, twice as fast as the GOST 28147-89 encryption algorithm, and requires only a modest amount of running-time memory. StriBob is a Round 1 candidate in the CAESAR competition. Аннотация. Аутентифицированное шифрование обеспечивает как конфиденциаль-ность, так и целостность данных за один проход. В работе показано, что LPS-преобразование в российском стандарте хэширования «Стрибог» в сочетании с кон-струкцией Sponge можно использовать для построения эффективно реализуемого низкоресурсного алгоритма аутентифицированного шифрования с ассоциированны-ми данными. Предлагаемый алгоритм «StriBob» имеет хорошие криптографические характеристики, работает быстрее хэш-функции «Стрибог», в два раза быстрее ал-горитма шифрования ГОСТ 28147-89 и использует небольшой объем оперативной памяти. Алгоритм «StriBob» является участником 1 этапа конкурса CAESAR.

show abstract

Beyond Modes: Building a Secure Record Protocol from a Cryptographic Sponge Permutation

Cited by 15 publications

References 43 publications

Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes

Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes

CBEAM: Efficient Authenticated Encryption from Feebly One-Way ϕ Functions

StriBob: authenticated encryption from GOST R 34.11-2012 LPS permutation

Contact Info

Product

Resources

About