Questions tagged [adversarial-model]

An adversary model formally defines the power of the adversary. It includes specifics whether the adversary is deterministic/randomized, uniform/non-uniform, interactive/non-interactive and how he interacts with the security game.

8 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
8
votes
0answers
152 views

How to build a security model

What are the minimal components to build a security model proof for a protocol? This question might seem trivial, but having read many papers-- from the IEEE, ACM, etc., that talk about a KMP-- I ...
4
votes
0answers
135 views

Explanation of the term “view” for algorithm or adversary

What is the view of an algorithm/adversary? Is view just a term used to describe the output over a set of inputs for a probabilistic algorithm? For example: Consider experiment Mac-forgeA,Π (n). ...
3
votes
0answers
127 views

How do adversary models and security types relate [from InfoSec SE]

I have been told to move the question to this forum in order to get a better insight, so here we go: Reading some questions in this forum I encountered this answer mentioning IND-CPA as a requirement ...
1
vote
0answers
30 views

Attacks on code misusing RSA_public_decrypt

I've encountered some code that I'm reviewing that is misusing RSA_public_decrypt to "authenticate" a variable-length response without using any hash. The code ...
1
vote
1answer
34 views

What does non-collusion assumption mean in server-aided protocol based on secret sharing?

Suppose $m$ clients split their own input into $n$ shares using additive secret sharing scheme (mod something). Then, each of the clients sends each share to each of $n$ external servers. After ...
1
vote
0answers
139 views

How to provide security against malicious adversary in Ring LWE homomorphic encryption scheme?

I was reading Ring LWE homomorphic encryption scheme referred in http://www.wisdom.weizmann.ac.il/~zvikab/localpapers/IdealHom.pdf But this encryption scheme provides security mostly in the semi-...
1
vote
0answers
101 views

Given the block cipher compute max PRF advantage

Hey all I'm having a bit of problem with this question. Not sure how to approach it. Any help will be appreciated :)
0
votes
0answers
72 views

Show that adversary indistinguishability is equivalent to specific perfect secrecy definition

How can I show that adversary indistinguishability (AI) is equivalent to the following deifinition of perfect secrecy (PS)?: $P[Enc_k(m_0) = c] = P[Enc_k(m_1) = c]$ for all $m_0,m_1 \in \mathcal{M},c ...