Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

Questions tagged [simulation]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0 votes
0 answers
18 views

Question about Environment Set in Universally Composable Security Proof

I have read into many papers and tutorials regarding "Universally Composable Security Proofs." I still have one confusion about the initial setup by the environment. On one hand, I got that ...
Novice User's user avatar
1 vote
1 answer
47 views

How can one model the behaviour of CKKS decryption noise?

I am trying to program a simulator for CKKS. It is a "simulator", in the sense that there is actually no encryption involved, but to a person seeing only the plaintexts (before encryption ...
Michael's user avatar
  • 31
1 vote
1 answer
32 views

Simulation-based proof of IKNP protocol(OT extension) for malicious adversary

I'm reading the well-known IKNP protocol for OT extension. In section 3.1, they give proofs for malicious Sender and semi-honest Receiver. I'm very confused about the proof for malicious Sender($S^*$)....
Yang's user avatar
  • 68
1 vote
1 answer
76 views

Why is zero knowledge defined via simulation w.r.t. inputs *in* the language?

In every definition of zero-knowledge (ZK) proof systems that I have seen (see, e.g., this one on Wikipedia, or this primer by Goldreich), a proof system $\langle p, v \rangle$ for a language $L$ is ...
Lewis Hammond's user avatar
3 votes
1 answer
43 views

MPC Security- Need for Joint Distribution

The security of the multi-party computation protocol can be given by real/ideal world paradigm. The simulator based proof considers the joint distribution of adversary's output and honest parties ...
Novice_researcher's user avatar
1 vote
1 answer
65 views

remove trusted setup (such as CRS) via running mpc

In the MPC protocol based on the common reference string (CRS) model, the CRS can be generated by the simulator, and the simulator can obtain the backdoor information in the CRS (such as the private ...
amyyy's user avatar
  • 33
0 votes
0 answers
23 views

Zero Knowledge Protocol for 3Coloring: Formal Proof

I am learning zero knowledge protocols, and studied the GMW protocol for 3-Coloring (https://www.wisdom.weizmann.ac.il/~oded/X/gmw1j.pdf). A similar proof is also presented in Oded Goldreich's ...
user31245's user avatar
0 votes
0 answers
118 views

What's the meaning of the assumption of "honest majority" in a mpc protocol? How to prove the security when (not) an honest majority assumption?

(1) What's the meaning of the assumption of "honest majority" in a mpc protocol? (2) How to prove the security when (not) an honest majority assumption?
Jeffrey's user avatar
  • 127
3 votes
1 answer
211 views

Resources for simple MPC proofs

Could anyone direct me to literature regarding privacy proofs in the MPC setting. For example, how can one prove the following simple problem: Suppose a setting with $n$ parties $S_1, \ldots, S_n$ ...
Kolja's user avatar
  • 143
3 votes
0 answers
96 views

"Simulator Based" vs "Game Based" security proof for a two-party computation protocol

I am trying to find out how to write a security proof for a two-party computation problem. I have read some examples to write simulators like $x_1 ∧ x_2$ problem and the example in Goldreich's book. I ...
m123's user avatar
  • 283
1 vote
0 answers
20 views

Rewinding and information oracle

I am working on a proof for a secure aggregation protocol in which the server aggregates values from several clients. A challenge in the proof is that the server may lie about which clients have ...
Hidde's user avatar
  • 111
2 votes
0 answers
60 views

Why does joint distribution of simulation output and functionality output is required?

I was going through this simulation tutorial. For example, let x and y be lists of data elements, and let f be a functionality that outputs an independent random sample of x ∪ y of some predetermined ...
Paritosh007's user avatar
2 votes
1 answer
181 views

Expanding stand-alone simulation-based proofs to UC proofs

This is a follow-up question to Mikero’s answer to Simulation-based proofs and universal composability proofs. Let there be some protocol $\pi$ running between two parties $A$ and $B$. Furthermore, ...
Simulator's user avatar
0 votes
2 answers
349 views

Security against malicious adversaries in MPC

I have a question in the context of two-party computation and the proof of the security of an MPC. I have looked at some of the beginning parts of this, this chapter 7, and this But I couldn't achieve ...
m123's user avatar
  • 283
3 votes
3 answers
146 views

Why we need to consider a probability ensemble and not just a probability distribution in the definition of Security under Simulation?

I'm currently reading this classic paper "How To Simulate It" and on most of the definitions it is using the term probability ensemble to represent the message space. From my understanding a ...
tur11ng's user avatar
  • 962
2 votes
0 answers
25 views

How to prove the security of the MT-based multiplication protocol via the simulation paradigm

It is known that Multiplicaiton Triple (MT) can be used for secure online multiplication, which is defined by $\mathsf{Mul}(x, y)=(z_0, z_1)$, where $x\cdot y = z_0 + z_1$ $P_0$ sample random $a$, ...
xxx's user avatar
  • 21
4 votes
0 answers
124 views

How to get started with Simulation and UC proofs?

I've been in my PhD program for a few months, and every time I try to understand the simulation and UC proof-paradigms I get so confused. I feel like what I really need is an easy set of (guided) ...
FearfulJoe's user avatar
1 vote
1 answer
110 views

Question on Simulation based security proof for Oblivious Transfer (OT) against semi-honest adversaries

I'm currently reading this How To Simulate It – A Tutorial on the Simulation Proof Technique. On p. 10, there is a proof using simulation for 1/2-OT, against semi-honest adversaries. Briefly, the ...
tur11ng's user avatar
  • 962
2 votes
1 answer
244 views

Simulation based proof for Beaver's multiplication protocol

Setup Recently, I became interested in simulation based proofs in the context of secure two party computation. I read some book chapters (from Secure MPC and Secret Sharing and Foundations on ...
opag's user avatar
  • 63
2 votes
0 answers
26 views

How to prove the security if a circuit is obscured by an IO,where the key generattion algorithm of a functional encryption is used in the circuit?

I want to design a scheme, where there is a circuit C0 which is obscured by an indistinguishability obfuscation (IO). In C0, a master key of a functional encryption (FE) is hardwired. Given an input z ...
laolien's user avatar
  • 51
3 votes
1 answer
60 views

About simulating abort in multiple party computation

I am new to the simulated proof and am a little bit confused about the abort in the simulation. When the real-time protocol abort, I assume that the ideal process should also abort? Does this mean ...
js wang's user avatar
  • 327
3 votes
1 answer
102 views

Is it common/valid to hardcode an element of a language into a simulator?

Short version: Is it a common practice (and a valid practice) to hardcode an element $d \in \mathcal{L}$ of a language into a simulator? (making the simulator non-uniform and non-constructive) Long ...
Léo Colisson's user avatar