搜索结果: 1-15 共查到“军事学 Combiners”相关记录16条 . 查询时间(0.073 秒)
Hash combiners are a practical way to make cryptographic hash functions more tolerant to future attacks and compatible with existing infrastructure. A combiner combines two or more hash functions in a...
Combiners for Backdoored Random Oracles
random oracle combiner communication complexity set- disjointness
2018/8/28
We formulate and study the security of cryptographic hash functions in the backdoored random-oracle (BRO) model, whereby a big brother designs a "good" hash function, but can also see arbitrary functi...
Functional encryption (FE) has incredible applications towards computing on encrypted data. However, constructing the most general form of this primitive has remained elusive. Although some candidate ...
Key-encapsulation mechanisms (KEMs) are a common stepping stone for constructing public-key encryption. Secure KEMs can be built from diverse assumptions, including ones related to integer factorizati...
Correlations Between (Nonlinear) Combiners of Input and Output of Random Functions and Permutations
correlation uniform random function uniform random permutation
2017/12/25
Daeman and Rijmen had derived the distributions of correlations between linear combinations of the input and output of uniform random functions and uniform random permutations. We generalise their res...
Resource-efficient OT combiners with active security
oblivious transfer combiners secret sharing
2017/6/9
An OT-combiner takes nn implementations of the oblivious transfer (OT) functionality, some of which may be faulty, and produces a secure instance of oblivious transfer as long as a large enough number...
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners
Hash Combiner Functional Graph XOR Combiner
2017/6/8
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners.
Encryptor Combiners: A Unified Approach to Multiparty NIKE, (H)IBE, and Broadcast Encryption
multiparty NIKE (H)IBE broadcast encryption
2017/2/23
We define the concept of an encryptor combiner. Roughly, such a combiner takes as input n public keys for a public key encryption scheme, and produces a new combined public key. Anyone knowing a secre...
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
Indistinguishability Obfuscation Universal Constructions Correctness Amplifiers
2017/2/20
Indistinguishability Obfuscation (iO) has enabled an incredible number of new and exciting applications. However, our understanding of how to actually build secure iO remains in its infancy. While man...
Robust Multi-Property Combiners for Hash Functions
hash functions robust combiner indifferentiability
2016/7/28
A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combi...
Obfuscation is challenging; we currently have practical candidates with rather vague security guarantees on the one side, and theoretical constructions which have recently experienced jeopardizing att...
New Attacks on the Concatenation and XOR Hash Combiners
Hash function cryptanalysis concatenation combiner
2016/2/23
We study the security of the concatenation combiner H1(M)kH2(M)
for two independent iterated hash functions with n-bit outputs that are
built using the Merkle-Damgⅹard construction. In 2004 Joux sho...
Robust Combiners for White-Box Security
White-box security Robust combiners cryptographic protocols
2009/6/3
White-box security techniques are employed to protect programs so that they can be executed
securely in untrusted environments, e.g. for copyright protection. We present the first robust
combiner fo...
Folklore, Practice and Theory of Robust Combiners
applied cryptography robust combiners foundations of cryptography
2009/4/15
Cryptographic schemes are often designed as a combination of multiple component
cryptographic modules. Such a combiner design is robust for a (security) specification if it meets
the specification, ...
Algebraic Attacks on Combiners with Memory and Several Outputs
algebraic attacks on stream ciphers pseudo-random generators multivariate equations
2009/4/9
Algebraic attacks on stream ciphers [14] recover the key by
solving an overdefined system of multivariate equations. Such attacks
can break several interesting cases of LFSR-based stream ciphers, wh...