搜索结果: 1-6 共查到“密码学 symmetric primitives”相关记录6条 . 查询时间(0.087 秒)
Security of Symmetric Primitives against Key-Correlated Attacks
Key-correlated attack related-key attack key-dependent-message attack
font style='font-size:12px;'>
2019/9/5
We study the security of symmetric primitives against key-correlated attacks (KCA), whereby an adversary can arbitrarily correlate keys, messages, and ciphertexts. Security against KCA is required whe...
Symmetric Primitives with Structured Secrets
Symmetric Primitives Structured Secrets
font style='font-size:12px;'>
2019/6/3
Securely managing encrypted data on an untrusted party is a challenging problem that has motivated the study of a variety of cryptographic primitives. A special class of such primitives allows an untr...
Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution)
Vision Rescue Marvellous
font style='font-size:12px;'>
2019/4/28
While common symmetric primitives like the AES and SHA3 are optimized for efficient hardware and software implementations, a range of emerging applications using advanced cryptographic protocols such ...
Post-Quantum Group Signatures from Symmetric Primitives
Post-Quantum Group Signatures Symmetric Primitives
font style='font-size:12px;'>
2018/3/12
Group signatures are used extensively for privacy in anonymous credentials schemes and in real-world systems for hardware enclave attestation. As such, there is a strong interest in making these schem...
Security of Symmetric Primitives under Incorrect Usage of Keys
incorrect key usage key-robustness authenticated encryption
font style='font-size:12px;'>
2017/4/5
We study the security of symmetric primitives under the incorrect usage of keys. Roughly speaking, a key-robust scheme does not output ciphertexts/tags that are valid with respect to distinct keys. Ke...
Lower Bounds on Signatures From Symmetric Primitives
Lower Bounds Signatures Symmetric Primitives
font style='font-size:12px;'>
2009/6/2
We show that every construction of one-time signature schemes from a random oracle achieves
black-box security at most 2(1+o(1))q, where q is the total number of oracle queries asked by the
key gene...