Ciphers for MPC and FHE
From MaRDI portal
Publication:2948338
DOI10.1007/978-3-662-46800-5_17zbMath1370.94477OpenAlexW632399495MaRDI QIDQ2948338
Martin R. Albrecht, Thomas Schneider, Tyge Tiessen, Michael Zohner, Christian Rechberger
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://encrypto.de/papers/ARSTZ15.pdf
block ciphermultiplicative complexityfully homomorphic encryptionsecure multiparty computationmultiplicative depth
Related Items (74)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Cryptanalysis of full LowMC and LowMC-M with algebraic techniques ⋮ Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath ⋮ Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions ⋮ Privacy-Preserving Prescription Drug Management Using Fully Homomorphic Encryption ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ 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 ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Multi-user security bound for filter permutators in the random oracle model ⋮ 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 ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ 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 ⋮ An algebraic attack on ciphers with low-degree round functions: application to full MiMC ⋮ Multiplicative complexity of vector valued Boolean functions ⋮ Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature ⋮ New cryptanalysis of LowMC with algebraic techniques ⋮ Optimizing S-Box Implementations for Several Criteria Using SAT Solvers ⋮ Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression ⋮ 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 ⋮ The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions ⋮ MRHS solver based on linear algebra and exhaustive search ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Boolean functions with multiplicative complexity 3 and 4 ⋮ Construction of Lightweight S-Boxes Using Feistel and MISTY Structures ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ 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 ⋮ Cryptanalysis of the FLIP Family of Stream Ciphers ⋮ 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
This page was built for publication: Ciphers for MPC and FHE
