搜索结果: 1-15 共查到“军队指挥学 hashing”相关记录86条 . 查询时间(0.06 秒)
A Framework for UC-Secure Commitments from Publicly Computable Smooth Projective Hashing
UC commitment smooth projective hash function SPHF
font style='font-size:12px;'>
2019/9/23
Hash proof systems or smooth projective hash functions (SPHFs) have been proposed by Cramer and Shoup (Eurocrypt'02) and can be seen as special type of zero-knowledge proof system for a language. Whil...
Isogeny-based hashing despite known endomorphisms
isogeny-based cryptography expander graphs hash functions
font style='font-size:12px;'>
2019/8/19
The Charles-Goren-Lauter hash function on isogeny graphs of supersingular elliptic curves was shown to be insecure under collision attacks when the endomorphism ring of the starting curve is known. Si...
Txilm: Lossy Block Compression with Salted Short Hashing
Blockchain Bitcoin Hash Algorithm
font style='font-size:12px;'>
2019/6/5
Current blockchains are restricted by the low throughput. Aimed at this problem, we propose Txilm, a protocol that compresses the size of transaction presentation in each block and thus saves the band...
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
AES MITM preimage
font style='font-size:12px;'>
2019/6/3
Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes. Sasaki in 2011 introduced the first preim...
Fast and simple constant-time hashing to the BLS12-381 elliptic curve
hash functions elliptic curve cryptosystem implementation
font style='font-size:12px;'>
2019/4/23
Pairing-friendly elliptic curves in the Barreto-Lynn-Scott family have experienced a resurgence in popularity due to their use in a number of real-world projects. One particular Barreto-Lynn-Scott cur...
Fine-Grained and Controlled Rewriting in Blockchains: Chameleon-Hashing Gone Attribute-Based
Chameleon-Hash Implementation Blockchain
font style='font-size:12px;'>
2019/4/23
Blockchain technologies recently received a considerable amount of attention. While the initial focus was mainly on the use of blockchains in the context of cryptocurrencies such as Bitcoin, applicati...
Securing Update Propagation with Homomorphic Hashing
Homomorphic Hashing Folly open-source library
font style='font-size:12px;'>
2019/3/4
In database replication, ensuring consistency when propagating updates is a challenging and extensively studied problem. However, the problem of securing update propagation against malicious adversari...
New Smooth Projective Hashing For Oblivious Transfer
cryptographic protocols SPH
font style='font-size:12px;'>
2018/6/5
Oblivious transfer is an important tool against malicious cloud server providers. Halevi-Kalai OT, which is based on smooth projective hash(SPH), is a famous and the most efficient framework for 11-ou...
On Distributional Collision Resistant Hashing
Collision Resistant Hashing Distributional Hashing Multi-Collision Resistance
font style='font-size:12px;'>
2018/5/28
Collision resistant hashing is a fundamental concept that is the basis for many of the important cryptographic primitives and protocols. Collision resistant hashing is a family of compressing function...
Founding Cryptography on Smooth Projective Hashing
oblivious transfer secure multiparty computation malicious adversaries
font style='font-size:12px;'>
2018/5/16
Oblivious transfer (OT) is a fundamental primitive in cryptography. Halevi-Kalai OT (Halevi, S. and Y. Kalai (2012), Journal of Cryptology 25(1)), which is based on smooth projective hash(SPH), is a f...
Cryptographic Hashing From Strong One-Way Functions
CRHFs OWPF
font style='font-size:12px;'>
2018/5/2
An interesting consequence of our results is a potential new avenue for bypassing black-box separations. In particular, proving (with necessarily non-black-box techniques) that parallel repetition amp...
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
LPN Worst-Case to Average Case Reductions Collision-Resistant Hashing
font style='font-size:12px;'>
2018/3/23
We present a worst case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter regime. Prior to this work, no worst case hardness re...
Efficient Circuit-based PSI via Cuckoo Hashing
Private Set Intersection Secure Computation
font style='font-size:12px;'>
2018/2/1
While there has been a lot of progress in designing efficient custom protocols for computing Private Set Intersection (PSI), there has been less research on using generic Multi-Party Computation (MPC)...
Just in Time Hashing
Just in Time Hashing Passwords Memory Hard Functions
font style='font-size:12px;'>
2018/1/31
In the past few years billions of user passwords have been exposed to the threat of offline cracking attempts. Such brute-force cracking attempts are increasingly dangerous as password cracking hardwa...
Hashing solutions instead of generating problems: On the interactive certification of RSA moduli
RSA parameter validation zero-knowledge proofs
font style='font-size:12px;'>
2018/1/12
Certain RSA-based protocols, for instance in the domain of group signatures, require a prover to convince a verifier that a set of RSA parameters is well-structured (e.g., that the modulus is the prod...