Boolean Functions for Homomorphic-Friendly Stream Ciphers
From MaRDI portal
Publication:3294876
DOI10.1007/978-3-030-36237-9_10zbMath1457.94106OpenAlexW2995809059MaRDI QIDQ3294876
Publication date: 29 June 2020
Published in: Algebra, Codes and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-36237-9_10
Related Items (5)
On the fast algebraic immunity of threshold functions ⋮ On the algebraic immunity of direct sum constructions ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Weightwise almost perfectly balanced functions: secondary constructions for all \(n\) and better weightwise nonlinearities ⋮ On the weightwise nonlinearity of weightwise perfectly balanced functions
Uses Software
Cites Work
- Unnamed Item
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Balancedness and correlation immunity of symmetric Boolean functions
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- Cryptanalysis of the FLIP Family of Stream Ciphers
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Algorithms in HElib
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
- Candidate One-Way Functions Based on Expander Graphs
- Symmetric Boolean Functions
- On the Degree, Nonlinearity, Algebraic Thickness, and Nonnormality of Boolean Functions, With Developments on Symmetric Functions
- A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Algebraic Attacks against Random Local Functions and Their Countermeasures
- Cryptographic Hardness of Random Local Functions–Survey
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- Fully homomorphic encryption using ideal lattices
- On the Algebraic Immunity of Symmetric Boolean Functions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Polynomial codes
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Boolean Functions for Homomorphic-Friendly Stream Ciphers
