English
Related papers

Related papers: Locating modifications in signed data for partial …

200 papers

Existing program verifiers can prove advanced properties about security protocol implementations, but are difficult to scale to large codebases because of the manual effort required. We develop a novel methodology called *Diodon* that…

Cryptography and Security · Computer Science 2025-11-20 Linard Arquint , Samarth Kishor , Jason R. Koenig , Joey Dodds , Daniel Kroening , Peter Müller

A possible method to solve the sign problem is developed by modifying the original theory. Considering several modifications of the partition function, the observable in the original theory is reconstructed from the identity connecting the…

High Energy Physics - Lattice · Physics 2017-11-30 Takahiro M. Doi , Shoichiro Tsutsui

For $\Lambda$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other…

Probability · Mathematics 2019-06-28 Fabian Freund , Arno Siri-Jégousse

Storing digital data in synthetic DNA faces challenges in ensuring data reliability in the presence of edit errors--deletions, insertions, and substitutions--that occur randomly during various stages of the storage process. Current…

Information Theory · Computer Science 2025-09-11 Serge Kas Hanna

This paper investigates the differentially private bipartite consensus algorithm over signed networks. The proposed algorithm protects each agent's sensitive information by adding noise with time-varying variances to the…

Systems and Control · Electrical Eng. & Systems 2023-04-04 Jimin Wang , Jieming Ke , Ji-Feng Zhang

We introduce a semidefinite programming algorithm to find the minimal quantum Fisher information compatible with an arbitrary dataset of mean values. This certification task allows one to quantify the resource content of a quantum system…

The problem of storing permutations in a distributed manner arises in several common scenarios, such as efficient updates of a large, encrypted, or compressed data set. This problem may be addressed in either a combinatorial or a coding…

Information Theory · Computer Science 2016-05-05 Netanel Raviv , Eitan Yaakobi , Muriel Medard

Signature-based Intrusion Detection Systems (SIDSs) are traditionally used to detect malicious activity in networks. A notable example of such a system is Snort, which compares network traffic against a series of rules that match known…

Cryptography and Security · Computer Science 2024-02-16 Ryan Guide , Eric Pauley , Yohan Beugin , Ryan Sheatsley , Patrick McDaniel

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is present. This problem is relevant in areas such as medical…

Information Theory · Computer Science 2022-10-24 Eric Price , Jonathan Scarlett , Nelvin Tan

Security and distributed infrastructure are two of the most common requirements for big data software. But the security features of the big data platforms are still premature. It is critical to identify, modify, test and execute some of the…

Cryptography and Security · Computer Science 2016-11-24 Santosh Aditham , Nagarajan Ranganathan

Modern applications, such as social networking systems and e-commerce platforms are centered around using large-scale databases for storing and retrieving data. Accesses to the database are typically enclosed in transactions that allow…

Programming Languages · Computer Science 2023-04-17 Ahmed Bouajjani , Constantin Enea , Enrique Román-Calvo

Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks. We consider an extension of this problem to unbalanced…

Data Structures and Algorithms · Computer Science 2013-08-02 Laurent Bulteau , Guillaume Fertin , Christian Komusiewicz , Irena Rusu

An algorithm of searching a zero of an unknown undimensional function is considered, measured at a point x with some error. The step sizes are random positive values and are calculated according to the rule: if two consecutive iterations…

Statistics Theory · Mathematics 2007-06-13 Alexander Plakhov , Pedro Cruz

Redactable signature schemes and sanitizable signature schemes are methods that permit modification of a given digital message and retain a valid signature. This can be applied to decentralized identity systems for delegating identity…

Cryptography and Security · Computer Science 2023-10-27 Bryan Kumara , Mark Hooper , Carsten Maple , Timothy Hobson , Jon Crowcroft

This paper develops a unified framework for partial identification and inference in stratified experiments with attrition, accommodating both equal and heterogeneous treatment shares across strata. For equal-share designs, we apply recent…

Econometrics · Economics 2026-01-21 Bruno Ferman , Davi Siqueira , Vitor Possebom

Accurate and efficient entity resolution is an open challenge of particular relevance to intelligence organisations that collect large datasets from disparate sources with differing levels of quality and standard. Starting from a…

Databases · Computer Science 2018-03-20 Yuhang Zhang , Kee Siong Ng , Michael Walker , Pauline Chou , Tania Churchill , Peter Christen

The recently developed "Data Set Diagonalization" method (DSD) is applied to measure compatibility of the data sets that are used to determine parton distribution functions (PDFs). Discrepancies among the experiments are found to be…

High Energy Physics - Phenomenology · Physics 2010-04-22 Jon Pumplin

We are in the era of data analytics and data science which is on full bloom. There is abundance of all kinds of data for example biometrics based data, satellite images data, chip-seq data, social network data, sensor based data etc. from a…

Computer Vision and Pattern Recognition · Computer Science 2017-08-17 Farhana Javed Zareen , Suraiya Jabin

Algorithmic verification of realistic systems to satisfy safety and other temporal requirements has suffered from poor scalability of the employed formal approaches. To design systems with rigorous guarantees, many approaches still rely on…

Systems and Control · Electrical Eng. & Systems 2024-03-18 Oliver Schön , Zhengang Zhong , Sadegh Soudjani

This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of self-stabilizing algorithms.In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-12-25 Amos Korman , Shay Kutten , Toshimitsu Masuzawa