Imagen de Portada

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zaman, Md Mahabub Uz, Tao, Liangde, Maldonado, Mark, Liu, Chang, Sunny, Ahmed, Xu, Shouhuai, Chen, Lin
Formato:	Preprint
Publicado:	2024
Materias:	Cryptography and Security Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Hardness Amplification for (Sparse) LPN
por: Aggarwal, Divesh, et al.
Publicado: (2026)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
por: Arif, Mohammad Ferry Husnil, et al.
Publicado: (2025)

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
por: Ren, Hanlin, et al.
Publicado: (2025)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
por: Hecht, Yahli, et al.
Publicado: (2025)

On the Computational Hardness of Quantum One-Wayness
por: Cavalar, Bruno, et al.
Publicado: (2023)

Characterizing the Distinguishability of Product Distributions through Multicalibration
por: Marcussen, Cassandra, et al.
Publicado: (2024)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
por: Morimae, Tomoyuki, et al.
Publicado: (2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography
por: Hiroka, Taiga, et al.
Publicado: (2025)

Generalized and Unified Equivalences between Hardness and Pseudoentropy
por: Hu, Lunjia, et al.
Publicado: (2025)

Efficient and Privacy-Preserving Binary Dot Product via Multi-Party Computation
por: Dehkordi, Fatemeh Jafarian, et al.
Publicado: (2025)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
por: Arteche, Noel, et al.
Publicado: (2024)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
por: Morimae, Tomoyuki, et al.
Publicado: (2025)

Mind the Gap? Not for SVP Hardness under ETH!
por: Aggarwal, Divesh, et al.
Publicado: (2025)

Improved Hardness of BDD and SVP Under Gap-(S)ETH
por: Bennett, Huck, et al.
Publicado: (2021)

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
por: Chen, Qiangqiang, et al.
Publicado: (2025)

Unifying computational entropies via Kullback-Leibler divergence
por: Agrawal, Rohit, et al.
Publicado: (2019)

Cryptographic Hardness of Score Estimation
por: Song, Min Jae
Publicado: (2024)

A Note on Quantum-Secure PRPs
por: Zhandry, Mark
Publicado: (2016)

Verifiable Quantum Advantage without Structure
por: Yamakawa, Takashi, et al.
Publicado: (2022)

A Computational Separation Between Quantum No-cloning and No-telegraphing
por: Nehoran, Barak, et al.
Publicado: (2023)

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
por: Bhattiprolu, Vijay, et al.
Publicado: (2024)

New constructions of pseudorandom codes
por: Ghentiyala, Surendra, et al.
Publicado: (2024)

Leakage-Resilient Extractors against Number-on-Forehead Protocols
por: Chattopadhyay, Eshan, et al.
Publicado: (2025)

Efficient derandomization of differentially private counting queries
por: Ghentiyala, Surendra
Publicado: (2025)

Differentially Private Compression and the Sensitivity of LZ77
por: Blocki, Jeremiah, et al.
Publicado: (2025)

A Survey on the Applications of Zero-Knowledge Proofs
por: Lavin, Ryan, et al.
Publicado: (2024)

Privacy-Preserving Hamming Distance Computation with Property-Preserving Hashing
por: Zhao, Dongfang
Publicado: (2025)

Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
por: Leverett, Eireann, et al.
Publicado: (2026)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
por: Herman, Tal, et al.
Publicado: (2024)

Lattice Based Crypto breaks in a Superposition of Spacetimes
por: Aggarwal, Divesh, et al.
Publicado: (2025)

Efficiently Batching Unambiguous Interactive Proofs
por: Berger, Bonnie, et al.
Publicado: (2025)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
por: Otsuji, Taisei, et al.
Publicado: (2026)

More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
por: Gretta, Lucas, et al.
Publicado: (2024)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
por: Minzer, Dor, et al.
Publicado: (2025)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
por: Ruangwises, Suthee
Publicado: (2024)

Black-Box Crypto is Useless for Pseudorandom Codes
por: Garg, Sanjam, et al.
Publicado: (2025)

Interactive Oracle Proofs of Proximity to Codes on Graphs
por: Delavenne, Hugo, et al.
Publicado: (2025)

Faster Mixing of Higher-Dimensional Random Reversible Circuits
por: Gay, William, et al.
Publicado: (2024)

A Zero-Knowledge PCP Theorem
por: Gur, Tom, et al.
Publicado: (2024)

Characterizing the Evolution of Psychological Factors Exploited by Malicious Emails
por: Longtchi, Theodore, et al.
Publicado: (2024)