Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

1.5K
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
1.5K
Probability in Statistics01:14

Probability in Statistics

20.5K
Probability is the likelihood of an event occurring. The term event is defined as a collection of results of a procedure. An event is a simple event when an outcome cannot be divided into simpler parts.
An example of a simple event is a coin toss. The result of a coin toss is either a head or a tail. Here, head and tail are two simple events. These two simple events make up the sample space. Further, the probability of an event occurring falls within the range of 0 to 1. The probability of an...
20.5K
Random Variables01:09

Random Variables

16.8K
A random variable is a single numerical value that indicates the outcome of a procedure. The concept of random variables is fundamental to the probability theory and was introduced by a Russian mathematician, Pafnuty Chebyshev, in the mid-nineteenth century.
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
16.8K
Law of Independent Assortment02:03

Law of Independent Assortment

61.1K
While Mendel’s Law of Segregation states that the two alleles for one gene are separated into different gametes, a different question of how different genes are inherited remains. For example, is the gene for tall plants inherited with the gene for green peas? Mendel asked this question by experimenting with a dihybrid cross; a cross in which both parents are homozygous for two distinct traits resulting in an F1 generation that are heterozygous for both traits.
61.1K
Probability Distributions01:32

Probability Distributions

11.1K
 The probability of a random variable x  is the likelihood of its occurrence. A probability distribution represents the probabilities of a random variable using a formula, graph, or table. There are two types of probability distribution– discrete probability distribution and continuous probability distribution.
A discrete probability distribution is a probability distribution of discrete random variables. It can be categorized into binomial probability distribution and Poisson...
11.1K
Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

3.0K
In the Carnot engine, which achieves the maximum efficiency between two reservoirs of fixed temperatures, the total change in entropy is zero. The observation can be generalized by considering any reversible cyclic process consisting of many Carnot cycles. Thus, it can be stated that the total entropy change of any ideal reversible cycle is zero.
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
3.0K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Physical One-Way Functions for Decentralized Consensus Via Proof of Physical Work.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2024
Same author

An end-to-end framework for private DGA detection as a service.

PloS one·2024
Same author

High performance logistic regression for privacy-preserving genome analysis.

BMC medical genomics·2021
Same author

Protecting Privacy of Users in Brain-Computer Interface Applications.

IEEE transactions on neural systems and rehabilitation engineering : a publication of the IEEE Engineering in Medicine and Biology Society·2019

Related Experiment Video

Updated: Nov 27, 2025

Applying Incongruent Visual-Tactile Stimuli during Object Transfer with Vibro-Tactile Feedback
05:43

Applying Incongruent Visual-Tactile Stimuli during Object Transfer with Vibro-Tactile Feedback

Published on: May 23, 2019

5.7K

On the Composability of Statistically Secure Random Oblivious Transfer.

Rafael Dowsley1, Jörn Müller-Quade2, Anderson C A Nascimento3

  • 1Department of Computer Science, Bar-Ilan University, Ramat Gan 5290002, Israel.

Entropy (Basel, Switzerland)
|December 8, 2020
PubMed
Summary

Statistically secure random oblivious transfer protocols are also universally composable. This means protocols proven secure under weaker definitions can be used in advanced, secure applications without compromising security.

Keywords:
random oblivious transferunconditional securityuniversal composability

More Related Videos

Quasi-light Storage for Optical Data Packets
07:45

Quasi-light Storage for Optical Data Packets

Published on: February 6, 2014

11.1K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

948

Related Experiment Videos

Last Updated: Nov 27, 2025

Applying Incongruent Visual-Tactile Stimuli during Object Transfer with Vibro-Tactile Feedback
05:43

Applying Incongruent Visual-Tactile Stimuli during Object Transfer with Vibro-Tactile Feedback

Published on: May 23, 2019

5.7K
Quasi-light Storage for Optical Data Packets
07:45

Quasi-light Storage for Optical Data Packets

Published on: February 6, 2014

11.1K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

948

Area of Science:

  • Cryptography
  • Theoretical Computer Science

Background:

  • Oblivious transfer (OT) is a fundamental cryptographic primitive.
  • Existing OT protocols are often proven secure under non-composable definitions.
  • Composable security is crucial for building complex, secure cryptographic systems.

Purpose of the Study:

  • To demonstrate that statistically secure random oblivious transfer protocols are also statistically universally composable.
  • To bridge the gap between non-composable and composable security definitions for OT.

Main Methods:

  • Formal security analysis of random oblivious transfer protocols.
  • Proof of statistical universal composability using simulation-based security.
  • Leveraging information-theoretical properties for security guarantees.

Main Results:

  • Random oblivious transfer protocols with statistical security are statistically universally composable.
  • These protocols are simulatable secure against unlimited adversaries, simulators, and environment machines.
  • The findings extend to protocols previously secured under weaker, non-composable definitions.

Conclusions:

  • Statistically secure random oblivious transfer protocols offer a stronger security guarantee than previously assumed.
  • Previous OT protocols can be safely integrated into arbitrary statistically secure composite applications.
  • This work enhances the practical applicability of existing oblivious transfer protocols in advanced cryptographic constructions.