# Tag Info

1

Steps 5 and 7 remain very important even when one ignores DoS attacks. $\;\;\;$ The RSA key-pairs use ​ e = 3 $\;\;\;$ Server signs $\: \langle \hspace{-0.03 in}$ RSA_modulus , RSA_ciphertext $\rangle \:$ and returns that to Client in step 3 $\;\;\;$ If computation is significantly more of a bottleneck than communication, $\;\;\;$ then Client computes ...

1

For this they have to register their public keys in a server: Alice generates her public and private keys (pub_A, priv_A). Alice sends pub_A to a public server. Bob generates his public and private keys (pub_B, priv_B). Bob sends pub_B to a public server. So, you are basicly exchange public keys and the server uses those as encryption ...

3

This is exactly where automatic protocol analysis tools can help you. For example, using the Scyther tool, the protocol description using symmetric encryption is: /* * Protocol description for Scyther * * Note we use 'K' to model 'k' since Scyther assumes 'k(.,.)' refers * to pre-shared keys between two agents. */ // The protocol description with ...

1

No. The whole point of doing a zero knowledge proof (in this case, a non-interactive zero knowledge proof) is that the verifier does not learn any additional information besides the statement that is intended to be proved. The Schnorr protocol allows to prove knowledge of the discrete logarithm without revealing the exponent. On top of that, the ...

1

Assuming you're actually asking wether there is a difference for TLS in between a (high-entropy) pre-shared key (PSK) and a (low-entropy) pre-shared password, the short answer is: No. The long answer, however is a bit more complicated. By itself the TLS-PSK ciphersuites don't differentiate between different degrees of entropy. However there are a few ...

Top 50 recent answers are included