Results 31 to 40 of about 436 (71)
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
Optimized Interpolation Attacks on LowMC [PDF]
, 2015 LowMC is a collection of block cipher families introduced at Eurocrypt 2015 by Albrecht et al. Its design is optimized for instantiations of multi-party computation, fully homomorphic encryption, and zero-knowledge proofs.
Itai Dinur +3 more
core
Faster Quantum Algorithms for MQ2 and Applications [PDF]
We study quantum algorithms for multivariate quadratic Boolean equation systems by focusing on their precise gate count. While better asymptotic algorithms are known, currently gate counts were only computed for exhaustive search (Schwabe and Westerbaan,
André Schrottenloher +2 more
core +1 more source
Algebraic Meet-in-the-Middle Attack on LowMC [PDF]
, 2022 By exploiting the feature of partial nonlinear layers, we propose a new technique called algebraic meet-in-the-middle (MITM) attack to analyze the security of LowMC, which can reduce the memory complexity of the simple difference enumeration attack over ...
Fukang Liu +4 more
core
The MPC-in-the-head paradigm and its applications [PDF]
, 2023 Hovedformålet med denne oppgaven er å studere MPC-i-hodet-teknikken og anvendelser av denne. Vi starter med å introdusere nødvendig bakgrunnsteori for forpliktelsesprotokoller, kunnskapsløse bevis og sikker flerpartiberegning før vi presenterer MPC-i ...
Lajord, Ola
core
Cryptanalysis of Low-Data Instances of Full LowMCv2 [PDF]
, 2018 LowMC is a family of block ciphers designed for a low multiplicative complexity. The specification allows a large variety of instantiations, differing in block size, key size, number of S-boxes applied per round and allowed data complexity. The number of
Christian Rechberger +2 more
core +3 more sources
Post-Quantum Authentication with Lightweight Cryptographic Primitives [PDF]
, 2021 We propose to adapt ”low-algebra” digital signature schemes SPHINCS+ and PICNIC, present in the NIST-PQC contest, to the limitations of resource-bounded low-end devices.
Henrique Faria, José Manuel Valença
core
Digital Signatures from Symmetric-Key Primitives [PDF]
, 2017 We propose practically efficient signature schemes which feature several attractive properties: (a) they only rely on the security of symmetric-key primitives (block ciphers, hash functions), and are therefore a viable candidate for post-quantum security,
Christian Rechberger +4 more
core
Realization of Bernstein-Vazirani quantum algorithm in an interactive educational game [PDF]
Quantum algorithms are celebrated for their computational superiority over classical counterparts, yet they pose significant learning challenges for non-physics audiences.
Gosal, David +3 more
core +2 more sources
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? [PDF]
, 2020 Ball, Marshall +4 more
core +1 more source