Ciphers for MPC and FHE
From MaRDI portal
Recommendations
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Higher-Order Cryptanalysis of LowMC
- Linear equivalence of block ciphers with partial non-linear layers: application to LowMC
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Optimized interpolation attacks on lowMC
Cited in
(only showing first 100 items - show all)- Exploring crypto dark matter: new simple PRF candidates and their applications
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Multiplicative complexity of vector valued Boolean functions
- MRHS solver based on linear algebra and exhaustive search
- The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions
- Traceable ring signatures: general framework and post-quantum security
- Boolean functions with multiplicative complexity 3 and 4
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- Mind the middle layer: the HADES design strategy revisited
- Generic compiler for publicly verifiable covert multi-party computation
- Banquet: short and fast signatures from AES
- The inverse of \(\chi\) and its applications to Rasta-like ciphers
- Post-quantum ID-based ring signatures from symmetric-key primitives
- The MALICIOUS framework: embedding backdoors into tweakable block ciphers
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Differential power analysis of the Picnic signature scheme
- Implementing Grover oracles for quantum key search on AES and LowMC
- On a generalization of substitution-permutation networks: the HADES design strategy
- Lightweight authenticated encryption mode suitable for threshold implementation
- Cryptanalysis of full LowMC and LowMC-M with algebraic techniques
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- One-time traceable ring signatures
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Integral attacks on Pyjamask-96 and round-reduced Pyjamask-128
- FASTA -- a stream cipher for fast FHE evaluation
- Differential uniformity and linearity of S-boxes by multiplicative complexity
- Feistel structures for MPC, and more
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Improved filter permutators for efficient FHE: better instances and implementations
- Linear equivalence of block ciphers with partial non-linear layers: application to LowMC
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Multi-user security bound for filter permutators in the random oracle model
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- New cryptanalysis of LowMC with algebraic techniques
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Cryptanalysis of the FLIP family of stream ciphers
- Simpira v2: a family of efficient permutations using the AES round function
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- \(\mathsf{xmx}\): a firmware-oriented block cipher based on modular multiplications
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Privacy-Preserving Prescription Drug Management Using Fully Homomorphic Encryption
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
- Improving the security and efficiency of block ciphers based on LS-designs
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
- Coefficient grouping: breaking Chaghri and more
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Resumable zero-knowledge for circuits from symmetric key primitives
- Secret can be public: low-memory AEAD mode for high-order masking
- Cryptanalysis of Ciminion
- 3-party distributed ORAM from oblivious set membership
- Algebraic meet-in-the-middle attack on LowMC
- Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256}
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- Combined fault and leakage resilience: composability, constructions and compiler
- Algebraic attacks on Rasta and Dasta using low-degree equations
- New attacks on LowMC instances with a single plaintext/ciphertext pair
- Transciphering framework for approximate homomorphic encryption
- Constructing and deconstructing intentional weaknesses in symmetric ciphers
- Provable security of HADES structure
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
- Improved quantum analysis of SPECK and LowMC
- Quantum circuit implementations of SM4 block cipher based on different gate sets
- Post-quantum verifiable random function from symmetric primitives in PoS blockchain
- Related-key differential cryptanalysis of GMiMC used in post-quantum signatures
- Coefficient grouping for complex affine layers
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Faster secure multi-party computation of AES and DES using lookup tables
- Linear cryptanalysis and its variants with fast Fourier transformation technique on MPC/FHE/ZK-friendly \(\mathbb{F}_p\)-based ciphers
- Related-cipher attacks: applications to Ballet and ANT
- A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields
- On the sequential indifferentiability of the Lai-Massey construction
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
- On the cryptographic properties of weightwise affine and weightwise quadratic functions
- Improved homomorphic evaluation for hash function based on TFHE
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- 3-party secure computation for RAMs: optimal and concretely efficient
- Scalable multi-party private set union from multi-query secret-shared private membership test
- A three-stage MITM attack on LowMC from a single plaintext-ciphertext pair
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
- Improved alternating-moduli PRFs and post-quantum signatures
- Scrutinizing the security of AES-based hashing and one-way functions
- Security analysis of the P-SPN structure with a class of linear layer matrix against invariant subspace attack
- From at least \(n/3\) to at most \(3\sqrt{n} \): correcting the algebraic immunity of the hidden weight bit function. Algebraic immunity upper bounds on weightwise degree-\(d\) functions and their implications
- \texttt{Transistor}: a TFHE-friendly stream cipher
- A unified framework for succinct garbling from homomorphic secret sharing
- A degree bound for the c-boomerang uniformity of permutation monomials
- Efficient permutation correlations and batched random access for two-party computation
- One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures
This page was built for publication: Ciphers for MPC and FHE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948338)
