Results 21 to 30 of about 126 (69)
Picnic with Friends: Constructing post quantum digital signature schemes [PDF]
, 2021 Det digitale signatursystemet, Picnic [5], er et post-kvantesystem som ble introdusert som en del av NIST-prosessen for å standardisere post-kvantekryptografi [15]. Vi ser på hvordan Picnic er konstruert, og sikkerhetsegenskapene til systemet.
Millerjord, Lise
core +1 more source
Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures [PDF]
, 2022 MPC-in-the-head based zero-knowledge proofs allow one to prove knowledge of a preimage for a circuit defined over a finite field F. In recent proofs the soundness depends on the size F, and small fields require more parallel repetitions, and therefore ...
Daniel Kales, Greg Zaverucha
core
Replication data for: The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers
, 2020 Inserting backdoors in encryption algorithms has long seemed like a very interesting, yet difficult problem. Most attempts have been unsuccessful for symmetric-key primitives so far and it remains an open problem how to build such ciphers.
Haoyang Wang, Thomas Peyrin
core +1 more source
Boolean Functions for Homomorphic-Friendly Stream Ciphers [PDF]
, 2019 The proliferation of small embedded devices having growing but still limited computing and data storage facilities, and the related development of cloud services with extensive storage and computing means, raise nowadays new privacy issues because of the
Claude Carlet, Pierrick Méaux
core +1 more source
Cryptanalysis of the MALICIOUS Framework [PDF]
, 2020 This note describes several attacks on the MALICIOUS framework for creating backdoored tweakable block ciphers. It is shown that, although the embedded malicious tweak pair itself is hard to recover, it is feasible to find additional weak tweak pairs ...
Tim Beyne, Chaoyun Li
core
Limbo: Efficient Zero-knowledge MPCitH-based Arguments [PDF]
, 2022 This work introduces a new interactive oracle proof system based on the MPC-in-the-Head paradigm. To improve concrete efficiency and offer flexibility between computation time and communication size, a generic proof construction based on multi-round MPC ...
Cyprien Delpech de Saint Guilhem +2 more
core
, 2015 Designing an efficient cipher was always a delicate balance between linear and non-linear operations. This goes back to the design of DES, and in fact all the way back to the seminal work of Shannon.Here we focus, for the first time, on an extreme corner
Albrecht, Martin +11 more
core +1 more source
Practical Homomorphic Evaluation of Block-Cipher-Based Hash Functions with Applications [PDF]
, 2023 Fully homomorphic encryption (FHE) is a powerful cryptographic technique allowing to perform computation directly over encrypted data. Motivated by the overhead induced by the homomorphic ciphertexts during encryption and transmission, the transciphering
Nicolas Quero +4 more
core
Cryptanalysis of symmetric-key primitives and its application to backdoor design
, 2021 This thesis focuses on the cryptanalysis of symmetric-key cryptography, one of the most important branches of modern cryptography. The research spans two aspects of cryptanalysis.
Wang, Haoyang
core +1 more source
On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy [PDF]
, 2020 Keyed and unkeyed cryptographic permutations often iterate simple round functions. Substitution-permutation networks (SPNs) are an approach that is popular since the mid 1990s. One of the new directions in the design of these round functions is to reduce
Christian Rechberger +4 more
core +1 more source