A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
Fuente:
arXiv
Guardado en:
| Autores principales: | Shishir, Fairuz Shadmani, Rizvee, Md Mashfiq, Hossain, Tanvir, Hoque, Tamzidul, Forte, Domenic, Shomaji, Sumaiya |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Adversary Resilient Learned Bloom Filters
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)
Invertible Bloom Lookup Tables with Less Memory and Randomness
por: Fleischhacker, Nils, et al.
Publicado: (2023)
por: Fleischhacker, Nils, et al.
Publicado: (2023)
Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
por: Dolev, Shlomi
Publicado: (2025)
por: Dolev, Shlomi
Publicado: (2025)
Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
por: Regehr, Matthew, et al.
Publicado: (2026)
por: Regehr, Matthew, et al.
Publicado: (2026)
HOACS: Homomorphic Obfuscation Assisted Concealing of Secrets to Thwart Trojan Attacks in COTS Processor
por: Hossain, Tanvir, et al.
Publicado: (2024)
por: Hossain, Tanvir, et al.
Publicado: (2024)
An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
por: Islam, Tariqul, et al.
Publicado: (2024)
por: Islam, Tariqul, et al.
Publicado: (2024)
Privacy Amplification Persists under Unlimited Synthetic Data Release
por: Pierquin, Clément, et al.
Publicado: (2026)
por: Pierquin, Clément, et al.
Publicado: (2026)
On the Price of Differential Privacy for Hierarchical Clustering
por: Deng, Chengyuan, et al.
Publicado: (2025)
por: Deng, Chengyuan, et al.
Publicado: (2025)
Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)
por: Hillebrand, Quentin, et al.
Publicado: (2025)
Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
por: Dong, Wei, et al.
Publicado: (2024)
por: Dong, Wei, et al.
Publicado: (2024)
Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
por: Goodrich, Michael T., et al.
Publicado: (2024)
por: Goodrich, Michael T., et al.
Publicado: (2024)
Private Lossless Multiple Release
por: Andersson, Joel Daniel, et al.
Publicado: (2025)
por: Andersson, Joel Daniel, et al.
Publicado: (2025)
Space-Efficient Private Estimation of Quantiles
por: Cafaro, Massimo, et al.
Publicado: (2025)
por: Cafaro, Massimo, et al.
Publicado: (2025)
Fast and Optimal Differentially Private Frequent-Substring Mining
por: Guo, Peaker, et al.
Publicado: (2026)
por: Guo, Peaker, et al.
Publicado: (2026)
Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)
por: Dinitz, Michael, et al.
Publicado: (2025)
Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
por: Ghazi, Badih, et al.
Publicado: (2024)
por: Ghazi, Badih, et al.
Publicado: (2024)
Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)
por: Chandra, Rishi, et al.
Publicado: (2024)
Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
por: Aggarwal, Divesh, et al.
Publicado: (2020)
por: Aggarwal, Divesh, et al.
Publicado: (2020)
Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)
por: Ghazi, Badih, et al.
Publicado: (2025)
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
por: Cummings, Rachel, et al.
Publicado: (2025)
por: Cummings, Rachel, et al.
Publicado: (2025)
It is high time we let go of the Mersenne Twister
por: Vigna, Sebastiano
Publicado: (2019)
por: Vigna, Sebastiano
Publicado: (2019)
On Learning Parities with Dependent Noise
por: Golowich, Noah, et al.
Publicado: (2024)
por: Golowich, Noah, et al.
Publicado: (2024)
Differentially Private Substring and Document Counting with Near-Optimal Error
por: Bernardini, Giulia, et al.
Publicado: (2024)
por: Bernardini, Giulia, et al.
Publicado: (2024)
Local Node Differential Privacy
por: Raskhodnikova, Sofya, et al.
Publicado: (2026)
por: Raskhodnikova, Sofya, et al.
Publicado: (2026)
On Wagner's k-Tree Algorithm Over Integers
por: Lin, Haoxing, et al.
Publicado: (2024)
por: Lin, Haoxing, et al.
Publicado: (2024)
Differentially Private Set Representations
por: Patel, Sarvar, et al.
Publicado: (2025)
por: Patel, Sarvar, et al.
Publicado: (2025)
Scalable Private Partition Selection via Adaptive Weighting
por: Chen, Justin Y., et al.
Publicado: (2025)
por: Chen, Justin Y., et al.
Publicado: (2025)
Fine-Grained Privacy Guarantees for Coverage Problems
por: Dhulipala, Laxman, et al.
Publicado: (2024)
por: Dhulipala, Laxman, et al.
Publicado: (2024)
Near-Universally-Optimal Differentially Private Minimum Spanning Trees
por: Hladík, Richard, et al.
Publicado: (2024)
por: Hladík, Richard, et al.
Publicado: (2024)
The Price of Privacy For Approximating Max-CSP
por: Dharangutte, Prathamesh, et al.
Publicado: (2026)
por: Dharangutte, Prathamesh, et al.
Publicado: (2026)
Sublinear Space Graph Algorithms in the Continual Release Model
por: Epasto, Alessandro, et al.
Publicado: (2024)
por: Epasto, Alessandro, et al.
Publicado: (2024)
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
por: Dhulipala, Laxman, et al.
Publicado: (2025)
por: Dhulipala, Laxman, et al.
Publicado: (2025)
Improved Lower Bound for Differentially Private Facility Location
por: Manurangsi, Pasin
Publicado: (2024)
por: Manurangsi, Pasin
Publicado: (2024)
Profile Reconstruction from Private Sketches
por: Wu, Hao, et al.
Publicado: (2024)
por: Wu, Hao, et al.
Publicado: (2024)
Continual Counting with Gradual Privacy Expiration
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
Count on Your Elders: Laplace vs Gaussian Noise
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
por: Andersson, Joel Daniel, et al.
Publicado: (2024)
Data Structures Meet Cryptography: 3SUM with Preprocessing
por: Golovnev, Alexander, et al.
Publicado: (2019)
por: Golovnev, Alexander, et al.
Publicado: (2019)
Hardening Confidential Federated Compute against Side-channel Attacks
por: Bell-Clark, James, et al.
Publicado: (2026)
por: Bell-Clark, James, et al.
Publicado: (2026)
Separating Oblivious and Adaptive Differential Privacy under Continual Observation
por: Bun, Mark, et al.
Publicado: (2026)
por: Bun, Mark, et al.
Publicado: (2026)
Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
por: Thießen, Thore, et al.
Publicado: (2024)
por: Thießen, Thore, et al.
Publicado: (2024)
Ejemplares similares
-
Adversary Resilient Learned Bloom Filters
por: Almashaqbeh, Ghada, et al.
Publicado: (2024) -
Invertible Bloom Lookup Tables with Less Memory and Randomness
por: Fleischhacker, Nils, et al.
Publicado: (2023) -
Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
por: Dolev, Shlomi
Publicado: (2025) -
Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
por: Regehr, Matthew, et al.
Publicado: (2026) -
HOACS: Homomorphic Obfuscation Assisted Concealing of Secrets to Thwart Trojan Attacks in COTS Processor
por: Hossain, Tanvir, et al.
Publicado: (2024)