Tootfinder

On the Robustness of LDP Protocols for Numerical Attributes under Data Poisoning Attacks
Xiaoguang Li, Zitao Li, Ninghui Li, Wenhai Sun
https://arxiv.org/abs/2403.19510

On the Robustness of LDP Protocols for Numerical Attributes under Data Poisoning Attacks
Recent studies reveal that local differential privacy (LDP) protocols are vulnerable to data poisoning attacks where an attacker can manipulate the final estimate on the server by leveraging the characteristics of LDP and sending carefully crafted data from a small fraction of controlled local clients. This vulnerability raises concerns regarding the robustness and reliability of LDP in hostile environments. In this paper, we conduct a systematic investigation of the robustness of state-of-th…

This https://arxiv.org/abs/2310.09663 has been replaced.
link: https://scholar.google.com/scholar?q=a

VBFT: Veloce Byzantine Fault Tolerant Consensus for Blockchains
Low latency is one of the most desirable features of partially synchronous Byzantine consensus protocols. Existing low-latency protocols have achieved consensus with just two communication steps by reducing the maximum number of faults the protocol can tolerate (from $f = \frac{n-1}{3}$ to $f = \frac{n+1}{5}$), \textcolor{black}{by relaxing protocol safety guarantees}, or by using trusted hardware like Trusted Execution Environment. Furthermore, these two-step protocols don't support rotating p…

This https://arxiv.org/abs/2402.18823 has been replaced.
initial toot: https://mastoxiv.page/@…

Learning protocols for the fast and efficient control of active matter
We show that it is possible to learn protocols that effect fast and efficient state-to-state transformations in simulation models of active particles. By encoding the protocol in the form of a neural network we use evolutionary methods to identify protocols that take active particles from one steady state to another, as quickly as possible or with as little energy expended as possible. Our results show that protocols identified by a flexible neural-network ansatz, which allows the optimization …

‘Placing safety protocols on AI is “lobotomizing” it in the same way that putting emissions standards or seat belts in a car is stunting its capacity to be human’
https://web.archive.org/web/2024022710

The Deeper Problem With Google’s Racially Diverse Nazis
Generative AI is not built to honestly mirror reality, no matter what its creators say.

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
https://arxiv.org/abs/2403.18591 https:…

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
We study networks of processes that all execute the same finite protocol and communicate synchronously in two different ways: a process can broadcast one message to all other processes or send it to at most one other process. In both cases, if no process can receive the message, it will still be sent. We establish a precise complexity class for two coverability problems with a parameterised number of processes: the state coverability problem and the configuration coverability problem. It is alr…

This https://arxiv.org/abs/2312.15600 has been replaced.
link: https://scholar.google.com/scholar?q=a

Context-aware Communication for Multi-agent Reinforcement Learning
Effective communication protocols in multi-agent reinforcement learning (MARL) are critical to fostering cooperation and enhancing team performance. To leverage communication, many previous works have proposed to compress local information into a single message and broadcast it to all reachable agents. This simplistic messaging mechanism, however, may fail to provide adequate, critical, and relevant information to individual agents, especially in severely bandwidth-limited scenarios. This motiv…

Protocols for Quantum Weak Coin Flipping
Atul Singh Arora, J\'er\'emie Roland, Chrysoula Vlachou, Stephan Weis
https://arxiv.org/abs/2402.15855 htt…

Protocols for Quantum Weak Coin Flipping
Weak coin flipping is an important cryptographic primitive -- it is the strongest known secure two-party computation primitive that classically becomes secure only under certain assumptions (e.g. computational hardness), while quantumly there exist protocols that achieve arbitrarily close to perfect security. This breakthrough result was established by Mochon in 2007 [arXiv:0711.4114]. However, his proof relied on the existence of certain unitary operators which was established by a non-constru…

This https://arxiv.org/abs/2312.10126 has been replaced.
link: https://scholar.google.com/scholar?q=a

Do Text Simplification Systems Preserve Meaning? A Human Evaluation via Reading Comprehension
Automatic text simplification (TS) aims to automate the process of rewriting text to make it easier for people to read. A pre-requisite for TS to be useful is that it should convey information that is consistent with the meaning of the original text. However, current TS evaluation protocols assess system outputs for simplicity and meaning preservation without regard for the document context in which output sentences occur and for how people understand them. In this work, we introduce a human ev…

This https://arxiv.org/abs/2305.17079 has been replaced.
link: https://scholar.google.com/scholar?q=a

Complete Multiparty Session Type Projection with Automata
Multiparty session types (MSTs) are a type-based approach to verifying communication protocols. Central to MSTs is a projection operator: a partial function that maps protocols represented as global types to correct-by-construction implementations for each participant, represented as a communicating state machine. Existing projection operators are syntactic in nature, and trade efficiency for completeness. We present the first projection operator that is sound, complete, and efficient. Our proj…

‘Discussing market power, Aaron Nielson, the Texas solicitor general, says that “there are a lot of competitors for Twitter or would-be competitors, including Threads from Meta, which is backed by one of the largest companies." They invested “massive amounts of money to break up the Twitter monopoly and they failed miserably,” Mr. Nielson said.’
Platforms and protocols get conflated; Folks still convince themselves that X enjoys centrality of historical Twitter.

‘Placing safety protocols on AI is “lobotomizing” it in the same way that putting emissions standards or seat belts in a car is stunting its capacity to be human’
https://web.archive.org/web/2024022710

The Deeper Problem With Google’s Racially Diverse Nazis
Generative AI is not built to honestly mirror reality, no matter what its creators say.

This https://arxiv.org/abs/2207.11756 has been replaced.
link: https://scholar.google.com/scholar?q=a

The Interplay of Spectral Efficiency, User Density, and Energy in Grant-based Access Protocols
We employ grant-based access with retransmissions for multiple users with small payloads, particularly at low spectral efficiency (SE). The radio resources are allocated via NOMA in the time into $T$ slots and frequency dimensions, with a measure of non-orthogonality $η$. Retransmissions are stored in a receiver buffer with a finite size $C_{\sf buf}$ and combined via HARQ, using Chase Combining (CC) and Incremental Redundancy (IR). We determine the best scaling for the SE (bits/rdof) and for …

Energy-Efficient Federated Learning in Cooperative Communication within Factory Subnetworks
Hamid Reza Hashempour, Gilberto Berardinelli, Ramoni Adeogun, Shashi Raj Pandey
https://arxiv.org/abs/2404.18010

Energy-Efficient Federated Learning in Cooperative Communication within Factory Subnetworks
This paper investigates energy-efficient transmission protocols in relay-assisted federated learning (FL) setup within industrial subnetworks, considering latency and power constraints. In the subnetworks, devices collaborate to train a global model by transmitting their local models at the edge-enabled primary access (pAP) directly or via secondary access points (sAPs), which act as relays to optimize the training latency. We begin by formulating the energy efficiency problem for our proposed …

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
https://arxiv.org/abs/2403.18591 https:…

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
We study networks of processes that all execute the same finite protocol and communicate synchronously in two different ways: a process can broadcast one message to all other processes or send it to at most one other process. In both cases, if no process can receive the message, it will still be sent. We establish a precise complexity class for two coverability problems with a parameterised number of processes: the state coverability problem and the configuration coverability problem. It is alr…

“Thanks FedEx, This is Why we Keep Getting Phished”
https://www.troyhunt.com/thanks-fedex-this-is-why-we-keep-getting-phished/
I wonder if FedEx’s own internal security processes and protocols are this messed up.

Thanks FedEx, This is Why we Keep Getting Phished
I've been getting a lot of those "your parcel couldn't be delivered" phishing attacks lately and if you're a human with a phone, you probably have been too. Just as a brief reminder, they look like this: These get through all the technical controls that exist at my telco and

This https://arxiv.org/abs/2312.12131 has been replaced.
link: https://scholar.google.com/scholar?q=a

Elliptic Curve Pairing Stealth Address Protocols
The protection of transactions privacy is extremely important for the user. With stealth address protocols (SAP), users can receive assets on stealth addresses that they do not link to their stealth meta-addresses. SAP can be generated using various cryptographic approaches. DKSAP uses elliptic curve multiplication and hashing of the resulting shared secret. Another approach is to use a bilinear mapping. The paper presents two SA protocols that use elliptic curve pairing as a cryptographic solu…

This https://arxiv.org/abs/2404.12901 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNI_…

Large Language Models for Networking: Workflow, Advances and Challenges
The networking field is characterized by its high complexity and rapid iteration, requiring extensive expertise to accomplish network tasks, ranging from network design, diagnosis, configuration and security. The inherent complexity of these tasks, coupled with the ever-changing landscape of networking technologies and protocols, poses significant hurdles for traditional machine learning-based methods. These methods often struggle to generalize and automate complex tasks in networking, as they …

This https://arxiv.org/abs/2404.06536 has been replaced.
initial toot: https://mastoxiv.page/@…

Exact Floquet flat band and heating suppression via two-rate drive protocols
We demonstrate the existence of exact Floquet flat bands implying strong violation of the eigenstate thermalization hypothesis in a large class of closed quantum many-body systems in the presence of a two-rate drive characterized by frequencies $Ω_1$ and $Ω_2=νΩ_1$. We provide the exact analytic condition for this phenomenon to occur for a generic protocol; in particular, $ν=(2p+1)$, where $p$ is an integer, leads to such flat bands for both square-pulse and cosine drive protocols for arbi…

This https://arxiv.org/abs/2311.08053 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Communication-Constrained Bayesian Active Knowledge Distillation
Conventional retransmission (ARQ) protocols are designed with the goal of ensuring the correct reception of all the individual transmitter's packets at the receiver. When the transmitter is a learner communicating with a teacher, this goal is at odds with the actual aim of the learner, which is that of eliciting the most relevant label information from the teacher. Taking an active learning perspective, this paper addresses the following key protocol design questions: (i) Active batch selection…

Protocols for Quantum Weak Coin Flipping
Atul Singh Arora, J\'er\'emie Roland, Chrysoula Vlachou, Stephan Weis
https://arxiv.org/abs/2402.15855 htt…

Protocols for Quantum Weak Coin Flipping
Weak coin flipping is an important cryptographic primitive -- it is the strongest known secure two-party computation primitive that classically becomes secure only under certain assumptions (e.g. computational hardness), while quantumly there exist protocols that achieve arbitrarily close to perfect security. This breakthrough result was established by Mochon in 2007 [arXiv:0711.4114]. However, his proof relied on the existence of certain unitary operators which was established by a non-constru…

#wayland-protocols 1.34 is out:
https://lists.freedesktop.org/archives/wayland-devel/2024-March/043537.html
This release comes with three ne…

Because people can't click a link and read it that way apparently, I'll post images from the Fediverse wiki page here that supports my claim that AP is the Fediverse. If anyone has anything else to say that isn't covered in these images, I'm willilng to entertain it.
But don't come into my replies saying "AP isn't the only protocol that's a part of the Fediverse" because I'm literally covering that right here, right now.
Sorry, I'm an…

Blueskyの成り立ちについてErin Conroy（@… ）がポストした一連の投稿は一読の価値がある。特にドーシーが非集権化を目指した理由をモデレーションに関する議論から逃げるためだと推察したところは見事。
https://progressives.social/@chargrill

The dangers of “decentralized” ID systems
https://paper.wf/crypto-agorism/the-dangers-of-decentralized-id-systems

This https://arxiv.org/abs/2311.09393 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation
Secure multiparty computation (MPC) techniques enable multiple parties to compute joint functions over their private data without sharing that data to other parties, typically by employing powerful cryptographic protocols to protect individual's data. One challenge when writing such functions is that most MPC languages force users to intermix programmatic and privacy concerns in a single application, making it difficult to change or audit a program's underlying privacy policy. Existing policy-a…

I am angry about what a bad product experience passkeys are. Folks have had, what, 3 years to get passkeys working? I'm an expert in computer systems with more than a casual understanding of login protocols. And I can neither make passkeys work nor understand what the systems are doing. What a failure.

This https://arxiv.org/abs/2301.03889 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

Earn While You Reveal: Private Set Intersection that Rewards Participants
In Private Set Intersection protocols (PSIs), a non-empty result always reveals something about the private input sets of the parties. Moreover, in various variants of PSI, not all parties necessarily receive or are interested in the result. Nevertheless, to date, the literature has assumed that those parties who do not receive or are not interested in the result still contribute their private input sets to the PSI for free, although doing so would cost them their privacy. In this work, for the…

Quantum-enhanced learning with a controllable bosonic variational sensor network
Pengcheng Liao, Bingzhi Zhang, Quntao Zhuang
https://arxiv.org/abs/2404.18293

Quantum-enhanced learning with a controllable bosonic variational sensor network
The emergence of quantum sensor networks has presented opportunities for enhancing complex sensing tasks, while simultaneously introducing significant challenges in designing and analyzing quantum sensing protocols due to the intricate nature of entanglement and physical processes. Supervised learning assisted by an entangled sensor network (SLAEN) [Phys. Rev. X 9, 041023 (2019)] represents a promising paradigm for automating sensor-network design through variational quantum machine learning. H…

https://techcrunch.…

Why Meta is looking to the fediverse as the future for social media | TechCrunch
Meta's move into the open social web, also known as the fediverse, is puzzling. Does the Facebook owner see open protocols as the future? Will it embrace

Fascinating ... Apple joins Signal to provide the most secure end-to-end encrypted messaging protocols. Note: Apple engineers created their own “Levels” and magically theirs is the highest. ;) But regardless, this is obviously strong encryption.
"Support for PQ3 will start to roll out with the public releases of iOS 17.4, iPadOS 17.4, macOS 14.4, and watchOS 10.4, and is already in the corresponding developer preview and beta releases.”

A profile of Chinese private hacking contractor I-Soon, as leaked documents show shady business practices, worker disgruntlement, poor security protocols, more (Associated Press)
https://apnews.com/article/chinese-hack…

Behind the doors of a Chinese hacking company, a sordid culture fueled by influence, alcohol and sex
China’s hacking industry, leaked internal documents reveal, is vast in size and scope but also suffers from shady business practices, disgruntlement over pay and work quality, and poor security protocols. China’s state security agencies have contracted large amounts of hacking and espionage work to private contractors to slash costs and expand their reach, allowing Beijing to direct a huge number of hackers to infiltrate systems overseas. But leaked documents from one contractor, I-Soon, sh…

How companies like iSpot and VideoAmp are trying to challenge Nielsen's ratings dominance, as the industry grapples with changing audience measurement protocols (Brian Steinberg/Variety)
https://variety.com/2024/tv/news/tv-ra…

TV's Latest Epic Battle: Upstarts Fight Nielsen for Ratings Dominance
A cadre of upstart firms and investors are doing battle with Nielsen to dominate audience measurement data reporting for the streaming era.

There’s quite a few people saying truly horribly things about Ryan Barrett, developer of Bridgy, who builds bridges between many different protocols, including now between ActivityPub and ATProtocol, the latter being what Bluesky runs.
I don’t fight about protocols on this account, but you can read my explanation on how to think about “bridge instances” on my other account.

UN-SAM: Universal Prompt-Free Segmentation for Generalized Nuclei Images
Zhen Chen, Qing Xu, Xinyu Liu, Yixuan Yuan
https://arxiv.org/abs/2402.16663 https:…

UN-SAM: Universal Prompt-Free Segmentation for Generalized Nuclei Images
In digital pathology, precise nuclei segmentation is pivotal yet challenged by the diversity of tissue types, staining protocols, and imaging conditions. Recently, the segment anything model (SAM) revealed overwhelming performance in natural scenarios and impressive adaptation to medical imaging. Despite these advantages, the reliance of labor-intensive manual annotation as segmentation prompts severely hinders their clinical applicability, especially for nuclei image analysis containing massiv…

This https://arxiv.org/abs/2404.14250 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDC_…

Frosty: Bringing strong liveness guarantees to the Snow family of consensus protocols
Snowman is the consensus protocol implemented by the Avalanche blockchain and is part of the Snow family of protocols, first introduced through the original Avalanche leaderless consensus protocol. A major advantage of Snowman is that each consensus decision only requires an expected constant communication overhead per processor in the `common' case that the protocol is not under substantial Byzantine attack, i.e. it provides a solution to the scalability problem which ensures that the expected…

This https://arxiv.org/abs/2311.09043 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Measurement-induced transitions beyond Gaussianity: a single particle description
Repeated measurements can induce entanglement phase transitions in the dynamics of quantum systems. Interacting models, both chaotic and integrable, generically show a stable volume-law entangled phase at low measurement rates which disappears for free, Gaussian fermions. Interactions break the Gaussianity of a dynamical map in its unitary part, but non-Gaussianity can be introduced through measurements as well. By comparing the entanglement and non-Gaussianity structure of different protocols,…

HotStuff-2 vs. HotStuff: The Difference and Advantage
Siyuan Zhao, Yanqi Wu, Zheng Wang
https://arxiv.org/abs/2403.18300 https://arxi…

HotStuff-2 vs. HotStuff: The Difference and Advantage
Byzantine consensus protocols are essential in blockchain technology. The widely recognized HotStuff protocol uses cryptographic measures for efficient view changes and reduced communication complexity. Recently, the main authors of HotStuff introduced an advanced iteration named HotStuff-2. This paper aims to compare the principles and analyze the effectiveness of both protocols, hoping to depict their key differences and assess the potential enhancements offered by HotStuff-2.

"During the workshop, participants from industry and academia brought up topics about #protocoldesign and development. Participants were interested in misalignments between protocol designers and users. Designers and engineers shared insights and lessons learned, especially about the mechanism of data deletion in these protocols. For instance, BlueSky designed its protocol to make data u…

Five Themes Discussed at Princeton's Workshop on Decentralized Social Media
On Monday, March 4, 2024, CITP and DeCenter co-hosted a workshop on the topic of decentralized social media. The invite-only workshop brought together a

This https://arxiv.org/abs/2305.08597 has been replaced.
initial toot: https://mastoxiv.page/@…

Analytical solution for optimal protocols of weak drivings
One of the main objectives of science is the recognition of a general pattern in a particular phenomenon in some particular regime. In this work, this is achieved with the analytical expression for the optimal protocol that minimizes the thermodynamic work and its variance for finite-time, isothermal, and weak processes. The method that solves the Euler-Lagrange integral equation is quite general and depends only on the time-reversal symmetry of the optimal protocol. The solution is composed of…

Protocols for Observational Studies: An Application to Regression Discontinuity Designs
Matias D. Cattaneo, Rocio Titiunik
https://arxiv.org/abs/2402.11640

Protocols for Observational Studies: An Application to Regression Discontinuity Designs
In his 2022 IMS Medallion Lecture delivered at the Joint Statistical Meetings, Prof. Dylan S. Small eloquently advocated for the use of protocols in observational studies. We discuss his proposal and, inspired by his ideas, we develop a protocol for the regression discontinuity design.

This headline is false. https://techcrunch.com/2024/02/14/bluesky-and-mastodon-users-are-having-a-fight-that-could-shape-the-next-generation-of-social-media/

Bluesky and Mastodon users are having a fight that could shape the next generation of social media | TechCrunch
As decentralized social networks become more popular, the way different protocols interact could set the stage for the future of the web.

I see an IC: A Mixed-Methods Approach to Study Human Problem-Solving Processes in Hardware Reverse Engineering
Ren\'e Walendy, Markus Weber, Jingjie Li, Steffen Becker, Carina Wiesen, Malte Elson, Younghyun Kim, Kassem Fawaz, Nikol Rummel, Christof Paar
https://arxiv.org/abs/2402.15452…

I see an IC: A Mixed-Methods Approach to Study Human Problem-Solving Processes in Hardware Reverse Engineering
Trust in digital systems depends on secure hardware, often assured through Hardware Reverse Engineering (HRE). This work develops methods for investigating human problem-solving processes in HRE, an underexplored yet critical aspect. Since reverse engineers rely heavily on visual information, eye tracking holds promise for studying their cognitive processes. To gain further insights, we additionally employ verbal thought protocols during and immediately after HRE tasks: Concurrent and Retrospec…

Can patient-specific acquisition protocol improve performance on defect detection task in myocardial perfusion SPECT?
Nu Ri Choi, Md Ashequr Rahman, Zitong Yu, Barry A. Siegel, Abhinav K. Jha
https://arxiv.org/abs/2403.17764

Can patient-specific acquisition protocol improve performance on defect detection task in myocardial perfusion SPECT?
Myocardial perfusion imaging using single-photon emission computed tomography (SPECT), or myocardial perfusion SPECT (MPS) is a widely used clinical imaging modality for the diagnosis of coronary artery disease. Current clinical protocols for acquiring and reconstructing MPS images are similar for most patients. However, for patients with outlier anatomical characteristics, such as large breasts, images acquired using conventional protocols are often sub-optimal in quality, leading to degraded …

TechCrunch weighs in on the Bluesky-bridging angst. Reasonably fair I think, except for the headline is absurd: I’m pretty sure almost nobody on Bluesky even knows this conversation is happening (nor cares): https://techcrunch.com/2…

Bluesky and Mastodon users are having a fight that could shape the next generation of social media | TechCrunch
As decentralized social networks become more popular, the way different protocols interact could set the stage for the future of the web.

Centralization in Proof-of-Stake Blockchains: A Game-Theoretic Analysis of Bootstrapping Protocols
Varul Srivastava, Sankarshan Damle, Sujit Gujar
https://arxiv.org/abs/2404.09627

Centralization in Proof-of-Stake Blockchains: A Game-Theoretic Analysis of Bootstrapping Protocols
Proof-of-stake (PoS) has emerged as a natural alternative to the resource-intensive Proof-of-Work (PoW) blockchain, as was recently seen with the Ethereum Merge. PoS-based blockchains require an initial stake distribution among the participants. Typically, this initial stake distribution is called bootstrapping. This paper argues that existing bootstrapping protocols are prone to centralization. To address centralization due to bootstrapping, we propose a novel game $Γ_\textsf{bootstrap}$. Nex…

This https://arxiv.org/abs/2403.10921 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Simultaneously Transmitting and Reflecting Reconfigurable Intelligent Surfaces Empowered Cooperative Rate Splitting with User Relaying
In this work, we unveil the advantages of synergizing cooperative rate splitting (CRS) with user relaying and simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR RIS). Specifically, we propose a novel STAR RIS-assisted CRS transmission framework, featuring six unique transmission modes that leverage various combination of the relaying protocols (including full duplex-FD and half duplex-HD) and the STAR RIS configuration protocols (including energy splitting-ES, m…

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
Jordan Kuschner, Yugarshi Shashwat, Sarthak Yadav, Marek Chrobak
https://arxiv.org/abs/2402.10783

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
Selective families of sets, or selectors, are combinatorial tools used to "isolate" individual members of sets from some set family. Given a set $X$ and an element $x\in X$, to isolate $x$ from $X$, at least one of the sets in the selector must intersect $X$ on exactly $x$. We study (k,N)-permutation selectors which have the property that they can isolate each element of each $k$-element subset of $\{0,1,...,N-1\}$ in each possible order. These selectors can be used in protocols for ad-hoc radi…

ChatSpamDetector: Leveraging Large Language Models for Effective Phishing Email Detection
Takashi Koide, Naoki Fukushi, Hiroki Nakano, Daiki Chiba
https://arxiv.org/abs/2402.18093

ChatSpamDetector: Leveraging Large Language Models for Effective Phishing Email Detection
The proliferation of phishing sites and emails poses significant challenges to existing cybersecurity efforts. Despite advances in spam filters and email security protocols, problems with oversight and false positives persist. Users often struggle to understand why emails are flagged as spam, risking the possibility of missing important communications or mistakenly trusting phishing emails. This study introduces ChatSpamDetector, a system that uses large language models (LLMs) to detect phish…

Unlike protocols that require a neutral third party to complete (arbitrated), or protocols that require that neutral third party to resolve disputes (adjudicated), 🔸self-enforcing protocols🔸 just work.
Cut-and-choose works because neither side can cheat. And while the math can get really complicated, the idea generalizes to multiple people.
Well, someone just solved gerrymandering in this way.
Prior solutions required either a bipartisan commission to create fair voting di…

This https://arxiv.org/abs/2402.16413 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

AI-enabled STAR-RIS aided MISO ISAC Secure Communications
A simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided integrated sensing and communication (ISAC) dual-secure communication system is studied in this paper. The sensed target and legitimate users (LUs) are situated on the opposite sides of the STAR-RIS, and the energy splitting and time switching protocols are applied in the STAR-RIS, respectively. The long-term average security rate for LUs is maximized by the joint design of the base station (BS) trans…

This https://arxiv.org/abs/2401.08610 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qfi…

Leverage Staking with Liquid Staking Derivatives (LSDs): Opportunities and Risks
Lido, the leading Liquid Staking Derivative (LSD) provider on Ethereum, allows users to stake an arbitrary amount of ETH to receive stETH, which can be integrated with Decentralized Finance (DeFi) protocols such as Aave. The composability between Lido and Aave enables a novel strategy called "leverage staking", where users stake ETH on Lido to acquire stETH, utilize stETH as collateral on Aave to borrow ETH, and then restake the borrowed ETH on Lido. Users can iteratively execute this process t…

Probabilistic work extraction on a classical oscillator beyond the second law
Nicolas Barros, Sergio Ciliberto, Ludovic Bellon
https://arxiv.org/abs/2402.18556

Probabilistic work extraction on a classical oscillator beyond the second law
We demonstrate experimentally that, applying optimal protocols which drive the system between two equilibrium states characterized by a free energy difference $ΔF$, we can maximize the probability of performing the transition between the two states with a work $W$ smaller than $ΔF$. The second law holds only on average, resulting in the inequality $\langle W \rangle \geq ΔF$. The experiment is performed using an underdamped oscillator evolving in a double-well potential. We show that with a …

Frosty: Bringing strong liveness guarantees to the Snow family of consensus protocols
Aaron Buchwald, Stephen Buttolph, Andrew Lewis-Pye, Patrick O'Grady, Kevin Sekniqi
https://arxiv.org/abs/2404.14250

Frosty: Bringing strong liveness guarantees to the Snow family of consensus protocols
Snowman is the consensus protocol implemented by the Avalanche blockchain and is part of the Snow family of protocols, first introduced through the original Avalanche leaderless consensus protocol. A major advantage of Snowman is that each consensus decision only requires an expected constant communication overhead per processor in the `common' case that the protocol is not under substantial Byzantine attack, i.e. it provides a solution to the scalability problem which ensures that the expected…

This https://arxiv.org/abs/2404.07795 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

From the Lab to the Theater: An Unconventional Field Robotics Journey
Artistic performances involving robotic systems present unique technical challenges akin to those encountered in other field deployments. In this paper, we delve into the orchestration of robotic artistic performances, focusing on the complexities inherent in communication protocols and localization methods. Through our case studies and experimental insights, we demonstrate the breadth of technical requirements for this type of deployment, and, most importantly, the significant contributions of…

This article describes how the BS bridge will work from a user perspective. #Mastodon #bluesky

Bluesky and Mastodon users are having a fight that could shape the next generation of social media | TechCrunch
As decentralized social networks become more popular, the way different protocols interact could set the stage for the future of the web.

2022 retro-link! https://notes.alinpanaitiu.com/Weird%20monitor bugs - Weird monitor bugs people sent me in the last 5 years.

So @… is suddenly Techcrunch famous.
Congratulations? Maybe?
https://techc…

Bluesky and Mastodon users are having a fight that could shape the next generation of social media | TechCrunch
As decentralized social networks become more popular, the way different protocols interact could set the stage for the future of the web.

It’s all fun and games until you realize that USB-C is a type of connector, not a protocol (doesn’t even have to be USB over it) and not a connector & protocol combination like most of what is depicted.
In other words, we switched from ports and connectors that had specific shapes for specific single protocols to a connector that looks the same but uses different protocols and mutually incompatible cables.
hashtag progress

Mx. Luna Corbden (@corbden@defcon.social)
Attached: 1 image You kids and your "USB-C." #GenX #tech #retrotech

[[Techcrunch]] picked up on a fraction of the Fediverse's apparent "closed by default" attitude towards [[Bluesky]]:
https://techcrunch.com/2024/02/14/bluesky-and-mastodon-users-are…

Bluesky and Mastodon users are having a fight that could shape the next generation of social media | TechCrunch
As decentralized social networks become more popular, the way different protocols interact could set the stage for the future of the web.

It’s all fun and games until you realize that USB-C is a type of connector, not a protocol (doesn’t even have to be USB over it) and not a connector & protocol combination like most of what is depicted.
In other words, we switched from ports and connectors that had specific shapes for specific single protocols to a connector that looks the same but uses different protocols and mutually incompatible cables.
hashtag progress

Mx. Luna Corbden (@corbden@defcon.social)
Attached: 1 image You kids and your "USB-C." #GenX #tech #retrotech

This https://arxiv.org/abs/2403.09514 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Quantum Fourier Transform using Dynamic Circuits
In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful protocols by drastically reducing the resource requirements for certain core algorithmic primitives. In particular, in the case of the $n$-qubit quantum Fourier transform followed immediately by measurement, the scaling of resource requirements is reduced fro…

Unlike protocols that require a neutral third party to complete (arbitrated), or protocols that require that neutral third party to resolve disputes (adjudicated), 🔸self-enforcing protocols🔸 just work.
Cut-and-choose works because neither side can cheat. And while the math can get really complicated, the idea generalizes to multiple people.
Well, someone just solved gerrymandering in this way.
Prior solutions required either a bipartisan commission to create fair voting di…

An Executable Specification of Oncology Dose-Escalation Protocols with Prolog
David C. Norris, Markus Triska
https://arxiv.org/abs/2402.08334 https://

An Executable Specification of Oncology Dose-Escalation Protocols with Prolog
We present, as a pure Prolog program, the first executable specification of the 3 + 3 dose-escalation protocol commonly used in early-phase oncology drug development. In this program, the imperative operations of the protocol emerge as consequences of clinically meaningful anticipatory-regret scenarios that are declared as CLP(Z) constraints. This 'regret-constrained' (RC) specification yields a robust formulation which can be used to prove clinically meaningful safety and liveness properties o…

The (almost) interesting history of Port Numbers
https://wirekat.com/the-almost-interesting-history-of-port-numbers/

This https://arxiv.org/abs/2403.13634 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

A Secure Quantum Key Distribution Protocol Using Two-Particle Transmission
The evolution of Quantum Key Distribution (QKD) relies on innovative methods to enhance its security and efficiency. Unextendible Product Bases (UPBs) hold promise in quantum cryptography due to their inherent indistinguishability, yet they are underutilized in QKD protocols. This paper introduces a protocol utilizing UPBs to establish quantum keys between distant parties. Specifically, we propose a protocol utilizing a $3\times 3$ tile UPB, where Alice sequentially transmits subsystem states t…

SECO: Secure Inference With Model Splitting Across Multi-Server Hierarchy
Shuangyi Chen, Ashish Khisti
https://arxiv.org/abs/2404.16232 https://

SECO: Secure Inference With Model Splitting Across Multi-Server Hierarchy
In the context of prediction-as-a-service, concerns about the privacy of the data and the model have been brought up and tackled via secure inference protocols. These protocols are built up by using single or multiple cryptographic tools designed under a variety of different security assumptions. In this paper, we introduce SECO, a secure inference protocol that enables a user holding an input data vector and multiple server nodes deployed with a split neural network model to collaboratively …

Mastodon stans: “Federation and open protocols are awesome so everyone can run servers and services!”
[someone makes Mastodon to Bluesky bridge with the federation and open protocols]
Mastodon stans: “No, not like that!”
This is starting to feel like email all over again, with big players having turf wars and small servers will be impossible to run because of enormous administrative overhead.

Scaling Game-Theoretic Security Reasoning
Sophie Rain, Lea Salome Brugger, Anja Petkovic Komel, Laura Kovacs, Michael Rawson
https://arxiv.org/abs/2403.10310

Scaling Game-Theoretic Security Reasoning
We present the CheckMate tool for automated verification of game-theoretic security properties, with application to blockchain protocols. CheckMate applies automated reasoning techniques to determine whether a game-theoretic protocol model is game-theoretically secure, that is, Byzantine fault tolerant and incentive compatible. We describe CheckMate's input format and its various components, modes, and output. CheckMate is evaluated on 14 benchmarks, including models of decentralized protocols,…

“the open source social web (aka the fediverse)”.
Hmm, not sure what to think about that description. I see the appeal but do we want to stretch “open source” all the way to include closed implementations of open protocols?
From a headline in #techcrunch about #flipboard.

Flipboard deepens its ties to the open source social web (aka the fediverse) | TechCrunch
Flipboard users can now see their new followers and other activity around the content they share in the fediverse directly in the Flipboard app.

Mastodon stans: “Federation and open protocols are awesome so everyone can run servers and services!”
[someone makes Mastodon to Bluesky bridge with the federation and open protocols]
Mastodon stans: “No, not like that!”
This is starting to feel like email all over again, with big players having turf wars and small servers will be impossible to run because of enormous administrative overhead.

This https://arxiv.org/abs/2401.01791 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDC_…

Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals
Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2δ$ (where $δ$ is the message transmission latency). While a protocol with a block period of $δ$ exists under the synchronous model, its commit latency is linear in the size of the system. To close this gap, we present the first chain-based BFT SMR protocols with $δ$ delay between the proposals of consecutive honest leaders and …

This https://arxiv.org/abs/2307.13212 has been replaced.
initial toot: https://mastoxiv.page/@…

Analytical Insights and Universal Behavior in Fast Thermal Equilibration Protocols
When a system deviates from equilibrium, it is possible to manipulate and control it to drive it towards equilibrium within a finite time $t_f$, even reducing its natural relaxation time scale $τ_{relax}$. Although numerous theoretical and experimental studies have explored these shortcut protocols, few have yielded analytical results for the probability distribution of work, heat and entropy production. In this paper, we propose a two-step protocol that captures the essential characteristics …

This https://arxiv.org/abs/2307.01063 has been replaced.
link: https://scholar.google.com/scholar?q=a

Synthesising Full-Information Protocols
We lay out a model of games with imperfect information that features explicit communication actions, by which the entire observation history of a player is revealed to another player. Such full-information protocols are common in asynchronous distributed systems; here, we consider a synchronous setting with a single active player who may communicate with multiple passive observers in an indeterminate environment. We present a procedure for solving the basic strategy-synthesis problem under regu…

CheckMate: Evaluating Checkpointing Protocols for Streaming Dataflows
George Siachamis, Kyriakos Psarakis, Marios Fragkoulis, Arie van Deursen, Paris Carbone, Asterios Katsifodimos
https://arxiv.org/abs/2403.13629

CheckMate: Evaluating Checkpointing Protocols for Streaming Dataflows
Stream processing in the last decade has seen broad adoption in both commercial and research settings. One key element for this success is the ability of modern stream processors to handle failures while ensuring exactly-once processing guarantees. At the moment of writing, virtually all stream processors that guarantee exactly-once processing implement a variant of Apache Flink's coordinated checkpoints - an extension of the original Chandy-Lamport checkpoints from 1985. However, the reasons b…

The topology of data hides in quantum thermal states
Stefano Scali, Chukwudubem Umeano, Oleksandr Kyriienko
https://arxiv.org/abs/2402.15633 https://

The topology of data hides in quantum thermal states
We provide a quantum protocol to perform topological data analysis (TDA) via the distillation of quantum thermal states. Recent developments of quantum thermal state preparation algorithms reveal their characteristic scaling defined by properties of dissipative Lindbladians. This contrasts with protocols based on unitary evolution which have a scaling depending on the properties of the combinatorial Laplacian. To leverage quantum thermal state preparation algorithms, we translate quantum TDA fr…

This https://arxiv.org/abs/2307.01063 has been replaced.
link: https://scholar.google.com/scholar?q=a

Synthesising Full-Information Protocols
We lay out a model of games with imperfect information that features explicit communication actions, by which the entire observation history of a player is revealed to another player. Such full-information protocols are common in asynchronous distributed systems; here, we consider a synchronous setting with a single active player who may communicate with multiple passive observers in an indeterminate environment. We present a procedure for solving the basic strategy-synthesis problem under regu…

Hawk: Accurate and Fast Privacy-Preserving Machine Learning Using Secure Lookup Table Computation
Hamza Saleem, Amir Ziashahabi, Muhammad Naveed, Salman Avestimehr
https://arxiv.org/abs/2403.17296

Hawk: Accurate and Fast Privacy-Preserving Machine Learning Using Secure Lookup Table Computation
Training machine learning models on data from multiple entities without direct data sharing can unlock applications otherwise hindered by business, legal, or ethical constraints. In this work, we design and implement new privacy-preserving machine learning protocols for logistic regression and neural network models. We adopt a two-server model where data owners secret-share their data between two servers that train and evaluate the model on the joint data. A significant source of inefficiency a…

CheckMate: Evaluating Checkpointing Protocols for Streaming Dataflows
George Siachamis, Kyriakos Psarakis, Marios Fragkoulis, Arie van Deursen, Paris Carbone, Asterios Katsifodimos
https://arxiv.org/abs/2403.13629

CheckMate: Evaluating Checkpointing Protocols for Streaming Dataflows
Stream processing in the last decade has seen broad adoption in both commercial and research settings. One key element for this success is the ability of modern stream processors to handle failures while ensuring exactly-once processing guarantees. At the moment of writing, virtually all stream processors that guarantee exactly-once processing implement a variant of Apache Flink's coordinated checkpoints - an extension of the original Chandy-Lamport checkpoints from 1985. However, the reasons b…

The topology of data hides in quantum thermal states
Stefano Scali, Chukwudubem Umeano, Oleksandr Kyriienko
https://arxiv.org/abs/2402.15633 https://

The topology of data hides in quantum thermal states
We provide a quantum protocol to perform topological data analysis (TDA) via the distillation of quantum thermal states. Recent developments of quantum thermal state preparation algorithms reveal their characteristic scaling defined by properties of dissipative Lindbladians. This contrasts with protocols based on unitary evolution which have a scaling depending on the properties of the combinatorial Laplacian. To leverage quantum thermal state preparation algorithms, we translate quantum TDA fr…

Communication Optimal Unbalanced Private Set Union
Jean-Guillaume DumasUGA, LJK, CASC, Alexis GalanCASC, Bruno GrenetCASC, Aude MaignanCASC, Daniel S. Roche
https://arxiv.org/abs/2402.16393

Communication Optimal Unbalanced Private Set Union
We consider the private set union (PSU) problem, where two parties each hold a private set of elements, and they want one of the parties (the receiver) to learn the union of the two sets and nothing else. Our protocols are targeted for the unbalanced case where the receiver's set size is larger than the sender's set size, with the goal of minimizing the costs for the sender both in terms of communication volume and local computation time. This setting is motivated by applications where the rece…

This https://arxiv.org/abs/2402.02320 has been replaced.
link: https://scholar.google.com/scholar?q=a

Spin: An Efficient Secure Computation Framework with GPU Acceleration
Accuracy and efficiency remain challenges for multi-party computation (MPC) frameworks. Spin is a GPU-accelerated MPC framework that supports multiple computation parties and a dishonest majority adversarial setup. We propose optimized protocols for non-linear functions that are critical for machine learning, as well as several novel optimizations specific to attention that is the fundamental unit of Transformer models, allowing Spin to perform non-trivial CNNs training and Transformer inferenc…

This https://arxiv.org/abs/2310.12716 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

A contextuality witness inspired by optimal state discrimination
Many protocols and tasks in quantum information science rely inherently on the fundamental notion of contextuality to provide advantages over their classical counterparts, and contextuality represents one of the main differences between quantum and classical physics. In this work we present a witness for preparation contextuality inspired by optimal two-state discrimination. The main idea is based on finding the accessible averaged success and error probabilities in both classical and quantum m…

Card-Based Overwriting Protocol for Equality Function and Applications
Suthee Ruangwises, Tomoki Ono, Yoshiki Abe, Kyosuke Hatsugai, Mitsugu Iwamoto
https://arxiv.org/abs/2402.16290

Card-Based Overwriting Protocol for Equality Function and Applications
Research in the area of secure multi-party computation with an unconventional method of using a physical deck of playing cards began in 1989 when den Boar proposed a protocol to compute the logical AND function using five cards. Since then, the area has gained interest from many researchers and several card-based protocols to compute various functions have been developed. In this paper, we propose a card-based protocol called the overwriting protocol that can securely compute the $k$-candidate …

This https://arxiv.org/abs/2311.08091 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDC_…

Lumiere: Making Optimal BFT for Partial Synchrony Practical
The view synchronization problem lies at the heart of many Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) protocols in the partial synchrony model, since these protocols are usually based on views. Liveness is guaranteed if honest processors spend a sufficiently long time in the same view during periods of synchrony, and if the leader of the view is honest. Ensuring that these conditions occur, known as Byzantine View Synchronization (BVS), has turned out to be the performance b…

This https://arxiv.org/abs/2404.15735 has been replaced.
link: https://scholar.google.com/scholar?q=a

Replacing Cryptopuzzles with Useful Computation in Blockchain Proof-of-Work Protocols
Proof-of-Work (PoW) blockchains have emerged as a robust and effective consensus mechanism in open environments like the Internet, leading to widespread deployment with numerous cryptocurrency platforms and substantial investments. However, the current PoW implementation primarily focuses on validating the discovery of a winning nonce. Exploring the notion of replacing cryptographic puzzles with useful computing tasks becomes compelling, given the substantial computational capacity of blockchai…

Navigating Quantum Security Risks in Networked Environments: A Comprehensive Study of Quantum-Safe Network Protocols
Yaser Baseri, Vikas Chouhan, Abdelhakim Hafid
https://arxiv.org/abs/2404.08232

Navigating Quantum Security Risks in Networked Environments: A Comprehensive Study of Quantum-Safe Network Protocols
The emergence of quantum computing poses a formidable security challenge to network protocols traditionally safeguarded by classical cryptographic algorithms. This paper provides an exhaustive analysis of vulnerabilities introduced by quantum computing in a diverse array of widely utilized security protocols across the layers of the TCP/IP model, including TLS, IPsec, SSH, PGP, and more. Our investigation focuses on precisely identifying vulnerabilities susceptible to exploitation by quantum ad…

Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Els\"asser, Hamed Hosseinpour, Dominik Kaaser, Peter Kling
https://arxiv.org/abs/2402.06471

Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
We consider the \emph{exact plurality consensus} problem for \emph{population protocols}. Here, $n$ anonymous agents start each with one of $k$ opinions. Their goal is to agree on the initially most frequent opinion (the \emph{plurality opinion}) via random, pairwise interactions. The case of $k = 2$ opinions is known as the \emph{majority problem}. Recent breakthroughs led to an always correct, exact majority population protocol that is both time- and space-optimal, needing $O(\log n)$ states …

Exact counterdiabatic driving for finite topological lattice models
Callum W. Duncan
https://arxiv.org/abs/2403.12150 https://arxiv.o…

Exact counterdiabatic driving for finite topological lattice models
Adiabatic protocols are often employed in state preparation schemes but require the system to be driven by a slowly varying Hamiltonian so that transitions between instantaneous eigenstates are exponentially suppressed. Counterdiabatic driving is a technique to speed up adiabatic protocols by including additional terms calculated from the instantaneous eigenstates that counter diabatic excitations. However, this approach requires knowledge of the full eigenspectrum meaning that the exact analyt…

This https://arxiv.org/abs/2311.09150 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Quest for optimal quantum resetting: protocols for a particle on a chain
In the classical context, it is well known that, sometimes, if the search does not find its target, it is better to start the process anew again, known as resetting. The quantum counterpart of resetting also indicates speeding up the detection process by eliminating the dark states, i.e., situations where the particle avoids detection. In this work, we introduce a most probable position resetting (MPR) protocol in which we reset the particle in a position where the probability of finding the pa…

This https://arxiv.org/abs/2310.11373 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced Performance
Sharding is essential for improving blockchain scalability. Existing protocols overlook diverse adversarial attacks, limiting transaction throughput. This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue, boosting blockchain scalability. Reticulum employs a two-phase approach, adapting transaction throughput based on runtime adversarial attacks. It comprises "control" and "process" shards in two layers. Process shards contain at least one trustworthy node, wh…

This https://arxiv.org/abs/2305.08460 has been replaced.
link: https://scholar.google.com/scholar?q=a

Selective Population Protocols
The model of population protocols provides a universal platform to study distributed processes driven by pairwise interactions of anonymous agents. While population protocols present an elegant and robust model for randomized distributed computation, their efficiency wanes when tackling issues that require more focused communication or the execution of multiple processes. To address this issue, we propose a new, selective variant of population protocols by introducing a partition of the state s…

Postselection technique for optical Quantum Key Distribution with improved de Finetti reductions
Shlok Nahar, Devashish Tupkary, Yuming Zhao, Norbert L\"utkenhaus, Ernest Tan
https://arxiv.org/abs/2403.11851

Postselection technique for optical Quantum Key Distribution with improved de Finetti reductions
The postselection technique is an important proof technique for proving the security of quantum key distribution protocols against coherent attacks. In this work, we go through multiple steps to rigorously apply the postselection technique to optical quantum key distribution protocols. First, we place the postselection technique on a rigorous mathematical foundation by fixing a technical flaw in the original postselection paper. Second, we extend the applicability of the postselection technique…

This https://arxiv.org/abs/2310.08499 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Nutation-Based Longitudinal Sensing Protocols for High-Field NMR With Nitrogen-Vacancy Centers in Diamond
Nitrogen vacancy (NV) centers in diamond enable nuclear magnetic resonance (NMR) spectroscopy of samples at the nano- and micron scales. However, at typical tesla-scale NMR magnetic field strengths, NV-NMR protocols become difficult to implement due to the challenge of driving fast NV pulse sequences sensitive to nuclear Larmor frequencies above a few megahertz. We perform simulations and theoretical analysis of the experimental viability of NV-NMR at tesla-scale magnetic fields using a new mea…

This https://arxiv.org/abs/2207.04939 has been replaced.
link: https://scholar.google.com/scholar?q=a

Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state
In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Consensus among the correct components can be reached by appropriately crafted communication protocols even in the presence of byzantine faults. Quantum-aided protocols built upon distributed entangled quantum states are worth considering, as they are more resilient than traditional ones. Based on earlier ideas, here we establish …

VPAS: Publicly Verifiable and Privacy-Preserving Aggregate Statistics on Distributed Datasets
Mohammed Alghazwi, Dewi Davies-Batista, Dimka Karastoyanova, Fatih Turkmen
https://arxiv.org/abs/2403.15208

VPAS: Publicly Verifiable and Privacy-Preserving Aggregate Statistics on Distributed Datasets
Aggregate statistics play an important role in extracting meaningful insights from distributed data while preserving privacy. A growing number of application domains, such as healthcare, utilize these statistics in advancing research and improving patient care. In this work, we explore the challenge of input validation and public verifiability within privacy-preserving aggregation protocols. We address the scenario in which a party receives data from multiple sources and must verify the valid…

One-sided DI-QKD secure against coherent attacks over long distances
Michele Masini, Shubhayan Sarkar
https://arxiv.org/abs/2403.11850 https://

One-sided DI-QKD secure against coherent attacks over long distances
Quantum Key Distribution (QKD) is a technique enabling provable secure communication but faces challenges in device characterization, posing potential security risks. Device-Independent (DI) QKD protocols overcome this issue by making minimal device assumptions but are limited in distance because they require high detection efficiencies, which refer to the ability of the experimental setup to detect quantum states. It is thus desirable to find quantum key distribution protocols that are based o…

This https://arxiv.org/abs/2302.10084 has been replaced.
link: https://scholar.google.com/scholar?q=a

OLYMPIA: A Simulation Framework for Evaluating the Concrete Scalability of Secure Aggregation Protocols
Recent secure aggregation protocols enable privacy-preserving federated learning for high-dimensional models among thousands or even millions of participants. Due to the scale of these use cases, however, end-to-end empirical evaluation of these protocols is impossible. We present OLYMPIA, a framework for empirical evaluation of secure protocols via simulation. OLYMPIA. provides an embedded domain-specific language for defining protocols, and a simulation framework for evaluating their performa…

This https://arxiv.org/abs/2311.05389 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Verifying the security of a continuous variable quantum communication protocol via quantum metrology
Quantum mechanics offers the possibility of unconditionally secure communication between multiple remote parties. Security proofs for such protocols typically rely on bounding the capacity of the quantum channel in use. In a similar manner, Cramér-Rao bounds in quantum metrology place limits on how much information can be extracted from a given quantum state about some unknown parameters of interest. In this work we establish a connection between these two areas. We first demonstrate a three-p…

This https://arxiv.org/abs/2311.10681 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

An efficient quantum parallel repetition theorem and applications
We prove a tight parallel repetition theorem for $3$-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of $4$-message computationally secure protocols does not generally decrease under parallel repetition. These mirror the classical results of Bellare, Impagliazzo, and Naor [BIN97]. Finally, we prove that all quantum argument systems can be generically compiled to a…

Variational protocols for emulating digital gates using analog control with always-on interactions
Claire Chevallier, Joseph Vovrosh, Julius de Hond, Mario Dagrada, Alexandre Dauphin, Vincent E. Elfving
https://arxiv.org/abs/2402.07653

Variational protocols for emulating digital gates using analog control with always-on interactions
We design variational pulse sequences tailored for neutral atom quantum simulators and show that we can engineer layers of single-qubit and multi-qubit gates. As an application, we discuss how the proposed method can be used to perform refocusing algorithms, SWAP networks, and ultimately quantum chemistry simulations. While the theoretical protocol we develop still has experimental limitations, it paves the way, with some further optimisation, for the use of analog quantum processors for variat…