Tagged Questions
0
votes
1answer
96 views
Is this scheme a provably fair random number generation?
I have thought up a method for generating random numbers between a client and a server which I hope is fair:
The client and server decide on a range in advance, $0$ trough $n-1$.
The server ...
2
votes
2answers
81 views
What are the cryptographic assumptions in the Dolev Yao model?
In the Dolev Yao model for interactive protocols, the cryptographic primitive (encryption, for example) is considered as a blackbox.
Does blackbox here mean that the primitive is to be considered CPA ...
2
votes
1answer
143 views
Why are protocols often proven secure under the random oracle model instead of a hash assumption?
Is this true that whenever you design a protocol using a hash function, you must prove its security under the random oracle?
I mean, is it possible to devise a protocol $P$ using a function $H$, and ...
2
votes
1answer
150 views
Exact mathematical definition of simulation based security?
I've been trying to understand cryptographic protocols and how to define their security. The problem is that while I can understand what the intuitive definition says, I have trouble understanding how ...
1
vote
0answers
92 views
Setting protocol parameters to achieve concrete security
Background
One issue with modern security proofs is that they are usually asymptotic. In other words, such proofs are usually formulated as follows: For any polynomial-time adversary $\mathcal A$, we ...
5
votes
1answer
216 views
How do process calculi, CSP, Promela, … compare?
In protocol analysis, formal verification is a very important tool.
What are the major differences between ...
