On the homomorphic computation of symmetric cryptographic primitives
From MaRDI portal
Publication:2870083
DOI10.1007/978-3-642-45239-0_3zbMATH Open1317.94124OpenAlexW12749313MaRDI QIDQ2870083FDOQ2870083
Authors: Silvia Mella, Ruggero Susella 
Publication date: 17 January 2014
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45239-0_3
Recommendations
Cited In (15)
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
- Improved homomorphic evaluation for hash function based on TFHE
- Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption
- Homomorphic operation of block cipher circuits based on MGSW15 scheme
- Revisiting homomorphic encryption schemes for finite fields
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Homomorphic AES evaluation using the modified LTV scheme
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- CLAASP: a cryptographic library for the automated analysis of symmetric primitives
- Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits
- On the computational hardness of the code equivalence problem in cryptography
- An algebraic approach to symmetric linear layers in cryptographic primitives
This page was built for publication: On the homomorphic computation of symmetric cryptographic primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870083)
