搜索结果: 1-15 共查到“军事学 L-function”相关记录219条 . 查询时间(0.055 秒)
The Function-Inversion Problem: Barriers and Opportunities
breaking block ciphers forging signatures
2019/9/19
The task of function inversion is central to cryptanalysis: breaking block ciphers, forging signatures, and cracking password hashes are all special cases of the function-inversion problem. In 1980, H...
A Study on the Applicability of the Lesamnta-LW Lightweight Hash Function to TPMS
TPMS 8-bit micro-controllers FELICS
2019/7/22
The Tire Pressure Monitoring System (TPMS) is used to monitor the pressure of the tires and to inform the driver of it. This equipment is mandatory for vehicles in US and EU. To ensure the security of...
Public-Key Function-Private Hidden Vector Encryption (and More)
function privacy obfuscation conjunctions
2019/6/26
Conjunctions. If the predicate computes a conjunction, our construction is a public-key function-private hidden vector encryption scheme. This addresses an open problem posed by Boneh, Raghunathan, an...
Non-Interactive MPC with Trusted Hardware Secure Against Residual Function Attacks
Non-Interactive MPC Communication round complexity Trusted hardware
2019/5/9
Secure multiparty computation (MPC) has been repeatedly optimized, and protocols with two communication rounds and strong security guarantees have been achieved. While progress has been made construct...
On the Streaming Indistinguishability of a Random Permutation and a Random Function
Streaming algorithm time-memory tradeoff switching lemma
2019/4/23
An adversary with SS bits of memory obtains a stream of QQ elements that are uniformly drawn from the set {1,2,…,N}{1,2,…,N}, either with or without replacement. This corresponds to sampling QQ elemen...
Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ variables Majority Function
Fast algebraic immunity Majority function Algebraic immunity
2019/3/20
Boolean functions used in some cryptosystems of stream ciphers should satisfy various criteria simultaneously to resist some known attacks. The fast algebraic attack (FAA) is feasible if one can find ...
Let σσ be some positive integer and C⊆{(i,j):1≤iind finding a lower bound on the number of distinct blocks P1,…,Pσ∈{0,1}nP1,…,Pσ∈{0,1}n satisfying a s...
Function-Dependent Commitments from Homomorphic Authenticators
public-key cryptography Homomorphic Authenticators Commitments
2019/3/2
In cloud computing, delegated computing raises the security issue of guaranteeing data authenticity during a remote computation. In this context, the recently introduced function-dependent commitments...
Tightly Secure Inner Product Functional Encryption: Multi-Input and Function-Hiding Constructions
functional encryption inner product tight security
2019/2/27
Tightly secure cryptographic schemes have been extensively studied in the fields of chosen-ciphertext secure public-key encryption (CCA-secure PKE), identity-based encryption (IBE), signature and more...
Vulnerability and Remedy of Stripped Function Logic Locking
Logic Locking SAT-based Attack Stripped Function Logic Locking
2019/2/26
Stripped Function Logic Locking (SFLL) as the most advanced logic locking technique is robust against both the SAT-based and the removal attacks under the assumption of thorough resynthesis of the str...
Testing the Randomness of Cryptographic Function Mappings
Statistical tests Bayesian model selection AES block cipher
2019/1/29
A cryptographic function with a fixed-length output, such as a block cipher, hash function, or message authentication code (MAC), should behave as a random mapping. The mapping's randomness can be eva...
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing
Secure Multiparty Computation SPDZ concrete efficiency
2019/1/29
Secure multiparty computation allows a set of mutually distrusting parties to securely compute a function of their private inputs, revealing only the output, even if some of the parties are corrupt. R...
Function Private Predicate Encryption for Low Min-Entropy Predicates
public-key cryptography ZIPE
2019/1/4
In this work, we propose new predicate encryption schemes for zero inner-product encryption (ZIPE) and non-zero inner-product encryption (NIPE) predicates from prime-order bilinear pairings, which are...
Multi-Party Oblivious RAM based on Function Secret Sharing and Replicated Secret Sharing Arithmetic
cryptographic protocols RAM
2019/1/2
In this work, we study the problem of constructing oblivious RAM for secure multi-party computation to obliviously access memory at private locations during secure computation. We build on recent two-...
Algebraic normal form of a bent function: properties and restrictions
Boolean function bent function linear function
2018/12/3
Maximally nonlinear Boolean functions in nn variables, where n is even, are called bent functions. There are several ways to represent Boolean functions. One of the most useful is via algebraic normal...