搜索结果: 1-15 共查到“军事学 Hash Functions,”相关记录131条 . 查询时间(0.095 秒)
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations
Collision Resistance Statistical Zero Knowledge Black box separations
2019/6/12
The complexity of collision-resistant hash functions has been long studied in the theory of cryptography. While we often think about them as a Minicrypt primitive, black-box separations demonstrate th...
We introduce a new primitive, called trapdoor hash functions (TDH), which are hash functions H:{0,1}n→{0,1}secH:{0,1}n→{0,1}sec with additional trapdoor function-like properties. Specifically, given a...
Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems
snark stark bulletproofs
2019/5/13
The area of practical proof systems, like SNARKs, STARKs, or Bulletproofs, is seeing a very dynamic development. Many use-cases of such systems involve, often as their most expensive apart, proving th...
Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems
snark stark bulletproofs
2019/5/13
The area of practical proof systems, like SNARKs, STARKs, or Bulletproofs, is seeing a very dynamic development. Many use-cases of such systems involve, often as their most expensive apart, proving th...
Hash functions from superspecial genus-2 curves using Richelot isogenies
isogeny-based cryptography genus 2 hyperelliptic curve CGL hash function
2019/3/21
Last year Takashima proposed a version of Charles, Goren and Lauter’s hash function using Richelot isogenies, starting from a genus-2 curve that allows for all subsequent arithmetic to be performed ov...
Deterministic Identity-Based Encryption from Lattice-Based Programmable Hash Functions with High Min-Entropy
deterministic identity-based encryption adaptively secure auxiliary-input
2019/1/26
There only exists one deterministic identity-based encryption (DIBE) scheme which is adaptively secure in the auxiliary-input setting, under the learning with errors (LWE) assumption. However, the mas...
Adversarially Robust Property Preserving Hash Functions
Hash function compression property-preserving
2018/12/3
Property-preserving hash functions are usually probabilistic: they use the random choice of a hash function from a family to achieve compression, and as a consequence, err on some inputs. Traditionall...
Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions
hash functions quantum attacks
2018/11/13
Hash functions are of fundamental importance in theoretical and in practical cryptography, and with the threat of quantum computers possibly emerging in the future, it is an urgent objective to unders...
We construct an efficiently verifiable slow-timed hash function. A slow-timed hash function is a hash function with the guarantee that its evaluation requires to run a given number of sequential steps...
Better Than Advertised: Improved Collision-Resistance Guarantees for MD-Based Hash Functions
hash functions MD transform SHA
2018/6/25
The MD transform that underlies the MD and SHA families iterates a compression function hh to get a hash function HH. The question we ask is, what property X of hh guarantees collision resistance (CR)...
Backdoored Hash Functions: Immunizing HMAC and HKDF
hash functions backdoors malicious hashing
2018/4/19
Security of cryptographic schemes is traditionally measured as the inability of resource-constrained adversaries to violate a desired security goal. The security argument usually relies on a sound des...
Long-Term Secure Time-Stamping using Preimage-Aware Hash Functions
Long-Term Security Timestamps Preimage Aware Hash Functions
2017/8/8
Commonly used digital signature schemes have a limited lifetime because their security is based on computational assumptions that will potentially break in the future when more powerful computers are ...
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions
hash functions zero knowledge succinct arguments
2017/6/1
We study multi-collision-resistant hash functions --- a natural relaxation of collision-resistant hashing that only guarantees the intractability of finding many (rather than two) inputs that map to t...
Multi Collision Resistant Hash Functions and their Applications
collision resistant hashing entropy approximation
2017/6/1
Collision resistant hash functions are functions that shrink their input, but for which it is computationally infeasible to find a collision, namely two strings that hash to the same value (although c...
A Uniform Class of Weak Keys for Universal Hash Functions
Universal hash function weak key Wegman-Carter scheme
2017/5/23
In this paper we investigate weak keys of universal hash functions (UHFs) from their combinatorial properties. We find that any UHF has a general class of keys, which makes the combinatorial propertie...