Copertina

A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Shishir, Fairuz Shadmani, Rizvee, Md Mashfiq, Hossain, Tanvir, Hoque, Tamzidul, Forte, Domenic, Shomaji, Sumaiya
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Cryptography and Security Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Adversary Resilient Learned Bloom Filters
di: Almashaqbeh, Ghada, et al.
Pubblicazione: (2024)

Invertible Bloom Lookup Tables with Less Memory and Randomness
di: Fleischhacker, Nils, et al.
Pubblicazione: (2023)

Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
di: Dolev, Shlomi
Pubblicazione: (2025)

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
di: Regehr, Matthew, et al.
Pubblicazione: (2026)

HOACS: Homomorphic Obfuscation Assisted Concealing of Secrets to Thwart Trojan Attacks in COTS Processor
di: Hossain, Tanvir, et al.
Pubblicazione: (2024)

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
di: Islam, Tariqul, et al.
Pubblicazione: (2024)

Privacy Amplification Persists under Unlimited Synthetic Data Release
di: Pierquin, Clément, et al.
Pubblicazione: (2026)

On the Price of Differential Privacy for Hierarchical Clustering
di: Deng, Chengyuan, et al.
Pubblicazione: (2025)

Improved Differentially Private Algorithms for Rank Aggregation
di: Hillebrand, Quentin, et al.
Pubblicazione: (2025)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
di: Dong, Wei, et al.
Pubblicazione: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
di: Goodrich, Michael T., et al.
Pubblicazione: (2024)

Private Lossless Multiple Release
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2025)

Space-Efficient Private Estimation of Quantiles
di: Cafaro, Massimo, et al.
Pubblicazione: (2025)

Fast and Optimal Differentially Private Frequent-Substring Mining
di: Guo, Peaker, et al.
Pubblicazione: (2026)

Differentially Private Matchings
di: Dinitz, Michael, et al.
Pubblicazione: (2025)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
di: Ghazi, Badih, et al.
Pubblicazione: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
di: Chandra, Rishi, et al.
Pubblicazione: (2024)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
di: Aggarwal, Divesh, et al.
Pubblicazione: (2020)

Private Hyperparameter Tuning with Ex-Post Guarantee
di: Ghazi, Badih, et al.
Pubblicazione: (2025)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
di: Cummings, Rachel, et al.
Pubblicazione: (2025)

It is high time we let go of the Mersenne Twister
di: Vigna, Sebastiano
Pubblicazione: (2019)

On Learning Parities with Dependent Noise
di: Golowich, Noah, et al.
Pubblicazione: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
di: Bernardini, Giulia, et al.
Pubblicazione: (2024)

Local Node Differential Privacy
di: Raskhodnikova, Sofya, et al.
Pubblicazione: (2026)

On Wagner's k-Tree Algorithm Over Integers
di: Lin, Haoxing, et al.
Pubblicazione: (2024)

Differentially Private Set Representations
di: Patel, Sarvar, et al.
Pubblicazione: (2025)

Scalable Private Partition Selection via Adaptive Weighting
di: Chen, Justin Y., et al.
Pubblicazione: (2025)

Fine-Grained Privacy Guarantees for Coverage Problems
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
di: Hladík, Richard, et al.
Pubblicazione: (2024)

The Price of Privacy For Approximating Max-CSP
di: Dharangutte, Prathamesh, et al.
Pubblicazione: (2026)

Sublinear Space Graph Algorithms in the Continual Release Model
di: Epasto, Alessandro, et al.
Pubblicazione: (2024)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
di: Dhulipala, Laxman, et al.
Pubblicazione: (2025)

Improved Lower Bound for Differentially Private Facility Location
di: Manurangsi, Pasin
Pubblicazione: (2024)

Profile Reconstruction from Private Sketches
di: Wu, Hao, et al.
Pubblicazione: (2024)

Continual Counting with Gradual Privacy Expiration
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2024)

Count on Your Elders: Laplace vs Gaussian Noise
di: Andersson, Joel Daniel, et al.
Pubblicazione: (2024)

Data Structures Meet Cryptography: 3SUM with Preprocessing
di: Golovnev, Alexander, et al.
Pubblicazione: (2019)

Hardening Confidential Federated Compute against Side-channel Attacks
di: Bell-Clark, James, et al.
Pubblicazione: (2026)

Separating Oblivious and Adaptive Differential Privacy under Continual Observation
di: Bun, Mark, et al.
Pubblicazione: (2026)

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
di: Thießen, Thore, et al.
Pubblicazione: (2024)