English
Related papers

Related papers: A Persistent Hierarchical Bloom Filter-based Frame…

200 papers

Printed Circuit Boards are the foundation for the functioning of any electronic device, and therefore are an essential component for various industries such as automobile, communication, computation, etc. However, one of the challenges…

Computer Vision and Pattern Recognition · Computer Science 2021-02-23 Tejas Khare , Vaibhav Bahel , Anuradha C. Phadke

Hierarchical Federated Learning (HFL) has recently emerged as a promising solution for intelligent decision-making in vehicular networks, helping to address challenges such as limited communication resources, high vehicle mobility, and data…

Cryptography and Security · Computer Science 2025-05-05 M. Saeid HaghighiFard , Sinem Coleri

Modulation format identification (MFI) is crucial in next-generation optical networks such as cognitive optical networks. An integrated-clustering-algorithm-based MFI scheme in a coherent optical communication system is proposed herein.…

Signal Processing · Electrical Eng. & Systems 2021-04-30 Wenbo Zhang , Jinmei Ye , Zixian Yue , Yuxiang Wang , Xulun Zhang , Xiaoguang Zhang , Lixia Xi

Verification of higher-order probabilistic programs is a challenging problem. We present a verification method that supports several quantitative properties of higher-order probabilistic programs. Usually, extending verification methods to…

Logic in Computer Science · Computer Science 2024-07-04 Satoshi Kura , Hiroshi Unno

In digital baseband processing, the forward error correction (FEC) unit belongs to the most demanding components in terms of computational complexity and power consumption. Hence, efficient implementation of FEC decoders is crucial for next…

Information Theory · Computer Science 2024-06-04 Claus Kestel , Lucas Johannsen , Norbert Wehn

With the growing scale of big data, probabilistic structures receive increasing popularity for efficient approximate storage and query processing. For example, Bloom filters (BF) can achieve satisfactory performance for approximate…

Data Structures and Algorithms · Computer Science 2019-12-17 Yue Fu , Rong Du , Haibo Hu , Man Ho Au , Dagang Li

We introduce bloomRF as a unified method for approximate membership testing that supports both point- and range-queries. As a first core idea, bloomRF introduces novel prefix hashing to efficiently encode range information in the hash-code…

Databases · Computer Science 2022-07-25 Bernhard Mößner , Christian Riegger , Arthur Bernhardt , Ilia Petrov

Physical Unclonable Functions (PUFs) exploit variations in the manufacturing process to derive bit sequences from integrated circuits, which can be used as secure cryptographic keys. Instead of storing the keys in an insecure, non-volatile…

Information Theory · Computer Science 2018-01-11 Sven Müelich , Sven Puchinger , Martin Bossert

Digital watermarking methods are commonly used to safeguard digital media copyrights by confirming ownership and deterring unauthorized use. However, without reliable third-party oversight, these methods risk security vulnerabilities during…

Cryptography and Security · Computer Science 2024-05-30 Xiaolong Xue , Guangyong Shang , Zhen Ma , Minghui Xu , Hechuan Guo , Kun Li , Xiuzhen Cheng

Approximate circuits often achieve exceptional trade-offs between computational accuracy and hardware efficiency, making them attractive for deployment as reusable Intellectual Property (IP) cores. However, safeguarding such circuits…

Hardware Architecture · Computer Science 2026-05-12 Lukas Sekanina , Vojtech Mrazek

Nowadays, a majority of System-on-Chips (SoCs) make use of Intellectual Property (IP) in order to shorten development cycles. When such IPs are developed, one of the main focuses lies in the high configurability of the design. This…

Software Engineering · Computer Science 2024-05-06 Aman Kumar , Sebastian Simon

Ultra-large chemical libraries are reaching 10s to 100s of billions of molecules. A challenge for these libraries is to efficiently check if a proposed molecule is present. Here we propose and study Bloom filters for testing if a molecule…

Chemical Physics · Physics 2023-04-12 Jorge Medina , Andrew D White

Quantum physical unclonable functions, or QPUFs, are rapidly emerging as theoretical hardware solutions to provide secure cryptographic functionalities such as key-exchange, message authentication, entity identification among others. Recent…

Quantum Physics · Physics 2021-01-15 Niraj Kumar , Rawad Mezher , Elham Kashefi

Automated verification of security protocols based on dynamic root of trust, typically relying on protected hardware such as TPM, involves several challenges that we address in this paper. We model the semantics of trusted computing…

Cryptography and Security · Computer Science 2018-07-24 Sergiu Bursuc , Christian Johansen , Shiwei Xu

Probabilistic load flow (PLF) allows to evaluate uncertainties introduced by renewable energy sources on system operation. Ideally, the PLF calculation is implemented for an entire grid requiring all the parameters of the transmission lines…

Systems and Control · Electrical Eng. & Systems 2020-04-21 Mengshuo Jia , Yi Wang , Chen Shen , Gabriela Hug

As fault-tolerant quantum computers scale, certifying the accuracy of computations performed with encoded logical qubits will soon become classically intractable. This creates a critical need for scalable, device-independent certification…

Quantum Physics · Physics 2025-10-08 James Mills , Adithya Sireesh , Dominik Leichtle , Joschka Roffe , Elham Kashefi

Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available as a key storage, the secret key can be derived from…

Bloom filter (BF) has been widely used to support membership query, i.e., to judge whether a given element x is a member of a given set S or not. Recent years have seen a flourish design explosion of BF due to its characteristic of…

Data Structures and Algorithms · Computer Science 2019-01-08 Lailong Luo , Deke Guo , Richard T. B. Ma , Ori Rottenstreich , Xueshan Luo

Formal verification is crucial for ensuring the robustness of security protocols against adversarial attacks. The Needham-Schroeder protocol, a foundational authentication mechanism, has been extensively studied, including its integration…

Cryptography and Security · Computer Science 2025-08-29 Kangfeng Ye , Roberto Metere , Jim Woodcock , Poonam Yadav

Physical unclonable functions (PUFs) are widely considered in secret key generation for resource constrained devices. However, PUFs require additional hardware overhead. In this paper, we focus on developing a PUF-efficient, robust, and…

Cryptography and Security · Computer Science 2021-03-09 Yonghong Bai , Zhiyuan Yan