DeepAI AI Chat
Log In Sign Up

Coalgebraic Tools for Randomness-Conserving Protocols

07/08/2018
by   Dexter Kozen, et al.
cornell university
0

We propose a coalgebraic model for constructing and reasoning about state-based protocols that implement efficient reductions among random processes. We provide basic tools that allow efficient protocols to be constructed in a compositional way and analyzed in terms of the tradeoff between latency and loss of entropy. We show how to use these tools to construct various entropy-conserving reductions between processes.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/18/2021

Certified Random Number Generation from Quantum Steering

The ultimate random number generators are those certified to be unpredic...
07/03/2018

Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations

We design and analyze new protocols to verify the correctness of various...
05/26/2022

SoK: Decentralized Randomness Beacon Protocols

The scientific interest in the area of Decentralized Randomness Beacon (...
01/23/2023

Verified reductions for optimization

Numerical and symbolic methods for optimization are used extensively in ...
08/28/2017

A Type System for Privacy Properties (Technical Report)

Mature push button tools have emerged for checking trace properties (e.g...
02/07/2023

Analyzing Network performance parameters using wireshark

Network performance can be a prime concern for network administrators. T...
11/20/2018

Extended formulations from communication protocols in output-efficient time

Deterministic protocols are well-known tools to obtain extended formulat...