搜索结果: 1-12 共查到“军事学 Hashes”相关记录12条 . 查询时间(0.066 秒)
Chameleon-Hashes with Dual Long-Term Trapdoors and Their Applications
digital signatures sanitizable signatures chameleon hashing
2018/11/6
A chameleon-hash behaves likes a standard collision-resistant hash function for outsiders. If, however, a trapdoor is known, arbitrary collisions can be found. Chameleon-hashes with ephemeral trapdoor...
Chameleon-Hashes with Ephemeral Trapdoors And Applications to Invisible Sanitizable Signatures
chameleon-hash functions chameleon-hash functions with ephemeral trapdoors trapdoor commitments
2017/2/20
A chameleon-hash function is a hash function that involves a trapdoor the knowledge of which allows one to find arbitrary collisions in the domain of the function. In this paper, we introduce the noti...
Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes
Cryptanalysis Galois/Counter Mode AES-GCM, Cycling Attacks Weak Keys
2012/3/28
The Galois/Counter Mode (GCM) of operation has been standardized by NIST to provide single-pass authenticated encryption. The GHASH authentication component of GCM belongs to a class of Wegman-Carter ...
New look at impossibility result on Dolev-Yao models with hashes
cryptographic protocols cryptanalysis hash functions
2011/7/25
Backes, Pfitzmann and Waidner showed in [7] that for protocols with hashes Dolev-Yao style models do not have cryptographically sound realization in the sense of BRSIM/UC in the standard model of cryp...
New look at impossibility result on Dolev-Yao models with hashes
cryptographic protocols / cryptanalysis hash functions
2012/3/27
Backes, Pfitzmann and Waidner showed in [7] that for protocols with hashes Dolev-Yao style models do not have cryptographically sound realization in the sense of BRSIM/UC in the standard model of cryp...
ID-Based Chameleon Hashes from Bilinear Pairings
Chameleon hash Chameleon signature ID-based cryptosystem Bilinear pairings
2009/4/10
Chameleon hash function is a trapdoor one-way hash func-
tion. The ID-based chameleon hash function was first introduced by Ate-
niese and Medeiros [1]. As discussed by [1], the general advantages o...
On the Key Exposure Problem in Chameleon Hashes
Digital signatures undeniable signatures collision-resistant hashing
2009/3/27
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature
schemes that provide non-transferability. However, that first construction employs a
chameleon hash that s...
Firstly, we demonstrate a pathological hash function choice that makes RSA-OAEP insecure.
This shows that at least some security property is necessary for the hash functions used in RSAOAEP.
We study an extension of the well-known Abadi-Rogaway
logic with hashes. Previously, we have given a sound computational in-
terpretation of this extension using Canetti's oracle hashing. This paper...
Limits of the Reactive Simulatability/UC of Dolev-Yao Models with Hashes
Reactive Simulatability UC Dolev-Yao Models Hashes
2008/10/30
Automated tools such as model checkers and theorem provers for the
analysis of security protocols typically abstract from cryptography by Dolev-Yao
models, i.e., abstract term algebras replace the r...
Sound Computational Interpretation of Formal Hashes
Sound Computational Interpretation Formal Hashes
2008/10/21
This paper provides one more step towards bridging the gap between
the formal and computational approaches to cryptographic protocols. We
extend the well-known Abadi-Rogaway logic with probabilistic...
Linearization Attacks Against Syndrome Based Hashes
FSB Syndrome Based Hashes Provably Secure Hashes Hash Function Cryptanalysis
2008/6/2
In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a
family of cryptographic hash functions. The security claim of the FSB hashes
is based on a coding theory problem with hard average-case ...