Concretely efficient lattice-based polynomial commitment from standard assumptions
Polynomial commitment is a crucial cryptographic primitive in constructing zkSNARKs. Most
practical constructions to date are either vulnerable against quantum adversaries or lack …
practical constructions to date are either vulnerable against quantum adversaries or lack …
Registered FE beyond predicates:(attribute-based) linear functions and more
This paper introduces the first registered functional encryption RFE scheme tailored for
linear functions. Distinctly different from classical functional encryption (FE), RFE addresses …
linear functions. Distinctly different from classical functional encryption (FE), RFE addresses …
[PDF][PDF] K-Waay: Fast and Deniable Post-Quantum X3DH without Ring Signatures.
The Signal protocol and its X3DH key exchange core are regularly used by billions of
people in applications like WhatsApp but are unfortunately not quantum-secure. Thus …
people in applications like WhatsApp but are unfortunately not quantum-secure. Thus …
Novel area-efficient and flexible architectures for optimal Ate pairing on FPGA
While FPGA is a suitable platform for implementing cryptographic algorithms, there are
several challenges associated with implementing Optimal Ate pairing on FPGA, such as …
several challenges associated with implementing Optimal Ate pairing on FPGA, such as …
G+ G: a Fiat-Shamir lattice signature based on convolved Gaussians
J Devevey, A Passelègue, D Stehlé - … on the Theory and Application of …, 2023 - Springer
We describe an adaptation of Schnorr's signature to the lattice setting, which relies on
Gaussian convolution rather than flooding or rejection sampling as previous approaches. It …
Gaussian convolution rather than flooding or rejection sampling as previous approaches. It …
Efficient Updatable Public-Key Encryption from Lattices
C Abou Haidar, A Passelègue, D Stehlé - … on the Theory and Application of …, 2023 - Springer
Updatable public key encryption has recently been introduced as a solution to achieve
forward-security in the context of secure group messaging without hurting efficiency, but so …
forward-security in the context of secure group messaging without hurting efficiency, but so …
Robust Decentralized Multi-client Functional Encryption: Motivation, Definition, and Inner-Product Constructions
Abstract Decentralized Multi-Client Functional Encryption (DMCFE) is a multi-user extension
of Functional Encryption (FE) without relying on a trusted third party. However, a …
of Functional Encryption (FE) without relying on a trusted third party. However, a …
FENet: Privacy-preserving neural network training with functional encryption
Privacy-preserving machine learning (PPML) has been gaining a lot of attention in recent
years, and several techniques have been proposed to achieve PPML. Cryptography-based …
years, and several techniques have been proposed to achieve PPML. Cryptography-based …
A refined hardness estimation of LWE in two-step mode
W Xia, L Wang, G Wang, D Gu, B Wang - IACR International Conference …, 2024 - Springer
Recently, researchers have proposed many LWE estimators, such as lattice-estimator
(Albrecht et al, Asiacrypt 2017) and leaky-LWE-Estimator (Dachman-Soled et al, Crypto …
(Albrecht et al, Asiacrypt 2017) and leaky-LWE-Estimator (Dachman-Soled et al, Crypto …
Achieving Secure On-Orbit Comparison in LEO Satellite-Enabled Offshore Wind Farm Surveillance
The low-Earth orbit (LEO) satellite constellation holds immense potential for offshore wind
farm surveillance since it can provide all-day and all-weather monitoring capabilities …
farm surveillance since it can provide all-day and all-weather monitoring capabilities …