搜索结果: 1-8 共查到“军队指挥学 Optimal security”相关记录8条 . 查询时间(0.031 秒)
Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with A Counterexample
Unique Signatures Tight Reduction Impossibility
2017/6/2
Optimal security reductions for unique signatures (Coron, Eurocrypt 2002) and their generalization, i.e., efficiently re-randomizable signatures (Hofheinz et al., PKC 2012 and Baderet al., Eurocrypt 2...
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory
PRP-to-PRF Encrypted Davies-Meyer Encrypted Davies-Meyer Dual
2017/5/31
At CRYPTO 2016, Cogliati and Seurin introduced the Encrypted Davies-Meyer construction, p2(p1(x)⊕x)p2(p1(x)⊕x) for two nn-bit permutations p1,p2p1,p2, and proved security up to 22n/322n/3. We present ...
Optimal Security Proofs for Signatures from Identification Schemes
Signatures Identification Schnorr tightness
2016/2/24
We perform a concrete security treatment of digital signature schemes obtained from canonical
identification schemes via the Fiat-Shamir transform. If the identification scheme is rerandomizable
and...
Tweakable Blockciphers with Asymptotically Optimal Security
tweakable blockcipher beyond birthday bound coupling
2016/1/3
We consider tweakable blockciphers with beyond the birthday bound security. Landecker, Shrimpton, and Terashima (CRYPTO 2012) gave the first construction with security up to O(22n/3) adversarial queri...
Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
Block ciphers Pseudorandomness
2016/1/3
This paper discusses provable security of two types of cascade encryptions. The first construction \CEl, called l-cascade encryption, is obtained by sequentially composing l blockcipher calls with ind...
Waters Signatures with Optimal Security Reduction
Digital signatures Waters signatures provable security black-box reductions
2012/6/14
Waters signatures (Eurocrypt 2005) can be shown existentially unforgeable under chosen-message attacks under the assumption that the computational Diffie-Hellman problem in the underlying (pairing-fri...
Waters Signatures with Optimal Security Reduction
public-key cryptography / Digital signatures Waters signatures, provable security black-box reductions
2012/3/20
Waters signatures (Eurocrypt 2005) can be shown existentially unforgeable under chosen-message attacks under the assumption that the computational Diffie-Hellman problem in the underlying (pairing-fri...
Optimal security proofs for PSS and other signature schemes
Optimal security proofs PSS signature schemes
2009/4/16
Optimal security proofs for PSS and other signature schemes.