Image de couverture de livre

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Qiangqiang, Ke, Yunfeng, Li, Shen, Li, Jinhai
Format:	Preprint
Publié:	2025
Sujets:	Cryptography and Security Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
par: Leverett, Eireann, et autres
Publié: (2026)

New constructions of pseudorandom codes
par: Ghentiyala, Surendra, et autres
Publié: (2024)

Privacy-Preserving Hamming Distance Computation with Property-Preserving Hashing
par: Zhao, Dongfang
Publié: (2025)

Efficient and Privacy-Preserving Binary Dot Product via Multi-Party Computation
par: Dehkordi, Fatemeh Jafarian, et autres
Publié: (2025)

Hardness Amplification for (Sparse) LPN
par: Aggarwal, Divesh, et autres
Publié: (2026)

An efficient construction of Raz's two-source randomness extractor with improved parameters
par: Foreman, Cameron, et autres
Publié: (2025)

Unifying computational entropies via Kullback-Leibler divergence
par: Agrawal, Rohit, et autres
Publié: (2019)

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms
par: Zaman, Md Mahabub Uz, et autres
Publié: (2024)

A Zero-Knowledge PCP Theorem
par: Gur, Tom, et autres
Publié: (2024)

A Survey on the Applications of Zero-Knowledge Proofs
par: Lavin, Ryan, et autres
Publié: (2024)

Leakage-Resilient Extractors against Number-on-Forehead Protocols
par: Chattopadhyay, Eshan, et autres
Publié: (2025)

Efficient derandomization of differentially private counting queries
par: Ghentiyala, Surendra
Publié: (2025)

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
par: Ren, Hanlin, et autres
Publié: (2025)

Differentially Private Compression and the Sensitivity of LZ77
par: Blocki, Jeremiah, et autres
Publié: (2025)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
par: Hecht, Yahli, et autres
Publié: (2025)

Lattice Based Crypto breaks in a Superposition of Spacetimes
par: Aggarwal, Divesh, et autres
Publié: (2025)

Efficiently Batching Unambiguous Interactive Proofs
par: Berger, Bonnie, et autres
Publié: (2025)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
par: Arif, Mohammad Ferry Husnil, et autres
Publié: (2025)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
par: Minzer, Dor, et autres
Publié: (2025)

Black-Box Crypto is Useless for Pseudorandom Codes
par: Garg, Sanjam, et autres
Publié: (2025)

Interactive Oracle Proofs of Proximity to Codes on Graphs
par: Delavenne, Hugo, et autres
Publié: (2025)

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
par: Bhattiprolu, Vijay, et autres
Publié: (2024)

Characterizing the Distinguishability of Product Distributions through Multicalibration
par: Marcussen, Cassandra, et autres
Publié: (2024)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
par: Herman, Tal, et autres
Publié: (2024)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
par: Otsuji, Taisei, et autres
Publié: (2026)

More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
par: Gretta, Lucas, et autres
Publié: (2024)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
par: Ruangwises, Suthee
Publié: (2024)

Faster Mixing of Higher-Dimensional Random Reversible Circuits
par: Gay, William, et autres
Publié: (2024)

A new lightweight additive homomorphic encryption algorithm
par: Pan, Wuqiong, et autres
Publié: (2023)

Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval
par: Ma, Guangsheng, et autres
Publié: (2024)

Experimental relativistic zero-knowledge proofs with unconditional security
par: Weng, Chen-Xun, et autres
Publié: (2025)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
par: Li, Xingjian, et autres
Publié: (2023)

Asymptotic stabilization under homomorphic encryption: A re-encryption free method
par: Feng, Shuai, et autres
Publié: (2025)

Permutational-key quantum homomorphic encryption with homomorphic quantum error-correction
par: Ouyang, Yingkai, et autres
Publié: (2022)

Pseudorandom Permutations from Random Reversible Circuits
par: He, William, et autres
Publié: (2024)

Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds
par: Dhar, Manik, et autres
Publié: (2022)

Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
par: Dinur, Itai, et autres
Publié: (2021)

Secret Sharing on Superconcentrator
par: Li, Yuan
Publié: (2023)

A Note on Quantum-Secure PRPs
par: Zhandry, Mark
Publié: (2016)

A Meta-Complexity Characterization of Quantum Cryptography
par: Cavalar, Bruno P., et autres
Publié: (2024)