搜索结果: 1-7 共查到“军队指挥学 multi-user security”相关记录7条 . 查询时间(0.062 秒)
Revisiting Key-alternating Feistel Ciphers for Shorter Keys and Multi-user Security
blockcipher provable security multi-user security
2018/11/19
Our results hold in the multi-user setting as well, constituting the first non-trivial multi-user provable security results on Feistel ciphers. We finally demonstrate applications of our results on de...
The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization
cryptographic protocols Nonce Randomization
2018/11/5
Multi-user (mu) security considers large-scale attackers (e.g., state actors) that given access to a number of sessions, attempt to compromise {\em at least} one of them. Mu security of authenticated ...
Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds
Multi-user security AES-GCM-SIV authenticated encryption
2018/2/8
This paper revisits the multi-user (mu) security of symmetric encryption, from the perspective of delivering an analysis of the AES-GCM-SIV AEAD scheme. Our end result shows that its mu security is co...
The Multi-User Security of Double Encryption
symmetric security provable security multi-user security
2017/2/21
It is widely known that double encryption does not substantially increase the security of a block cipher. Indeed, the classical meet-in-the middle attack recovers the 2k2k-bit secret key at the cost o...
The Multi-User Security of Authenticated Encryption: AES-GCM in TLS 1.3
authenticated encryption TLS 1.3 multi-user security
2016/6/6
We initiate the study of multi-user (mu) security of authenticated encryption (AE) schemes as
a way to rigorously formulate, and answer, questions about the “randomized nonce” mechanism
proposed for...
Key-alternating Ciphers and Key-length Extension: Exact Bounds and Multi-user Security
Symmetric cryptography block ciphers provable security
2016/6/6
This paper revisits the concrete security of key-alternating ciphers and key-length extension
schemes, with respect to tightness and multi-user security. The best existing bounds on the concrete
sec...
AMAC is a simple and fast candidate construction of a PRF from an MD-style hash function
which applies the keyed hash function and then a cheap, un-keyed output transform such as
truncation. Spurred...