# Tag Info

3

Your idea lacks forward secrecy, which protocols like TLS often (in newer versions anyway) offer. Otherwise it is close to how such things are usually done. To get forward secrecy you would instead use an ephemeral Diffie-Hellman key exchange, which you would authenticate with the pre-shared public key (which would be a signing key, not an encryption key, ...

2

As no particular attack scenario has been given I'd add another, more high level option. When point-to-point transport security isn't supposed to be secure enough then you might consider end-to-end message security or application level security as well. The idea of TLS is that it protects messages from client to server. However, the client and the server ...

1

As an addition to the other answers: there are indeed multiple solutions available to you that do not rely on designing your own encryption-scheme and code. This is of importance as it is very easy to make mistakes on both the scheme and the implementation level. You might for example be able to take a certain (trusted) algorithm which should be safe and ...

1

Question1: How can we show/prove that the random element only with a negligible probability can have such structure? If we assume the random oracle model and have $h: \{0,1\}^* \to \{0,1\}^n$ then we can state that $h(.)$ is equivalent to randomly sampling from $\{0,1\}^n$. Thus for a random element $r = r'||r''$ the probability that $r$ has the structure \$...

Only top voted, non community-wiki answers of a minimum length are eligible