New answers tagged perfect-secrecy
0
votes
Almost (epsilon) perfect secrecy - lower bound of keyspace size
This question has been discussed in Beating Shannon requires BOTH
efficient adversaries AND non-zero advantage by Yevgeniy Dodis, NYU, 2012/053.
First, consider the Definition 1 and Remark 2. Remark 2 ...
Top 50 recent answers are included
Related Tags
perfect-secrecy × 180encryption × 39
one-time-pad × 38
cryptanalysis × 12
provable-security × 12
security-definition × 10
information-theory × 9
secret-sharing × 8
multiparty-computation × 8
diffie-hellman × 7
xor × 7
public-key × 6
key-exchange × 6
entropy × 6
keys × 5
symmetric × 5
classical-cipher × 5
aes × 4
rsa × 3
block-cipher × 3
protocol-design × 3
stream-cipher × 3
chosen-plaintext-attack × 3
random-oracle-model × 3
semantic-security × 3