Image de couverture de livre

Bi-objective Optimization in Role Mining

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Crampton, Jason, Eiben, Eduard, Gutin, Gregory, Karapetyan, Daniel, Majumdar, Diptapriyo
Format:	Preprint
Publié:	2024
Sujets:	Cryptography and Security Artificial Intelligence Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Role of piracy in quantum proofs
par: Broadbent, Anne, et autres
Publié: (2024)

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

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

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

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

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

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)

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

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

A Zero-Knowledge PCP Theorem
par: Gur, Tom, 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 Amplification for (Sparse) LPN
par: Aggarwal, Divesh, et autres
Publié: (2026)

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)

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

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

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

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

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
par: Chen, Qiangqiang, 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)

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

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)

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

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

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)

Red Teaming AI Red Teaming
par: Majumdar, Subhabrata, et autres
Publié: (2025)

Pseudorandom density matrices
par: Bansal, Nikhil, et autres
Publié: (2024)

Clifford Strategies in Interactive Protocols are Classically Simulatable
par: Shalit, Itay
Publié: (2024)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
par: Arteche, Noel, et autres
Publié: (2024)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
par: Ananth, Prabhanjan, et autres
Publié: (2024)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
par: Grilo, Alex B., et autres
Publié: (2024)

Oblivious Defense in ML Models: Backdoor Removal without Detection
par: Goldwasser, Shafi, et autres
Publié: (2024)

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