搜索结果: 1-14 共查到“军事学 transformations”相关记录14条 . 查询时间(0.076 秒)
Breaking the Lightweight Secure PUF: Understanding the Relation of Input Transformations and Machine Learning Resistance
Physically Unclonable Function Machine Learning Modelling Attack
2019/7/15
Physical Unclonable Functions (PUFs) and, in particular, XOR Arbiter PUFs have gained much research interest as an authentication mechanism for embedded systems. One of the biggest problems of (strong...
Faster Homomorphic Linear Transformations in HElib
Homomorphic encryption Implementation Linear transformations
2018/3/9
HElib is a software library that implements homomorphic encryption (HE), with a focus on effective use of "packed" ciphertexts. An important operation (which is used in bootstrapping, as well as in ot...
Formal Verification of Side-channel Countermeasures via Elementary Circuit Transformations
Side-channel countermeasures masking formal verification
2017/9/14
We describe a technique to formally verify the security of masked implementations against side-channel attacks, based on elementary circuit transformations. We describe two complementary approaches: a...
Oblivious Neural Network Predictions via MiniONN transformations
privacy machine learning neural network predictions
2017/5/25
Machine learning models hosted in a cloud service are increasingly popular but risk privacy: clients sending prediction requests to the service need to disclose potentially sensitive information. In t...
Generic Transformations of Predicate Encodings: Constructions and Applications
Predicate Encryption Attribute-Based Encryption Predicate Encodings
2016/12/7
Predicate encodings are information-theoretic primitives that
can be transformed generically into predicate encryption schemes for a
broad class of predicates (Wee, TCC 2014; Chen, Gay, Wee, EUROCRY...
In the rich literature of secure multi-party computation (MPC), several important results rely on “protocol transformations,” whereby protocols from one model of MPC are transformed to protocols from ...
Pseudoentropy: Lower-bounds for Chain rules and Transformations
pseudorandomness pseudoentropy lower bounds
2016/2/23
Computational notions of entropy have recently found many applications, including leakageresilient
cryptography, deterministic encryption or memory delegation. The two main types of
results which ma...
Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
bilinear maps composite-order groups Groth-Sahai proofs
2016/1/9
At Eurocrypt 2010, Freeman presented a framework to convert cryptosystems based on compositeorder
groups into ones that use prime-order groups. Such a transformation is interesting not only from
a c...
Exploiting Transformations of the Galois Configuration to Improve Guess-and-Determine Attacks on NFSRs
Guess-and-determine NFSR Sprout
2015/12/21
Guess-and-determine attacks are based on guessing a subset
of internal state bits and subsequently using these guesses together with
the cipher’s output function to determine the value of the remain...
Malleable Signatures: Complex Unary Transformations and Delegatable Anonymous Credentials
malleability signatures anonymity
2013/4/18
A signature scheme is malleable if, on input a message m and a signature $\sigma$, it is possible to efficiently compute a signature $\sigma'$ on a related message $m' = T(m)$, for a transformation T ...
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
blind signatures pairings composite-order groups
2010/9/9
In this paper, we show that there are limits to such transformations. Specifically, we show that Freeman's properties, cancelling and projecting, cannot simultaneously be obtained using prime-order gr...
Security of Polynomial Transformations of the Diffe-Hellman Key
Security Polynomial Transformations Diffe-Hellman Key
2009/4/17
D. Boneh and R. Venkatesan have recently proposed an approach
to proving that a reasonably small portions of most significant bits of
the Diffe-Hellman key modulo a prime are as secure the the whole...
On the Affine Transformations of HFE-Cryptosystems and Systems with Branches
Affine Transformations HFE-Cryptosystems
2009/4/3
On the Affine Transformations of HFE-Cryptosystems and Systems with Branches.
Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations
one-way functions one-way permutations quasigroup string transformations
2009/3/9
In this paper we propose a definition and construction of
a new family of one-way candidate functions RN : QN ! QN, where
Q = {0, 1, . . . , s−1} is an alphabet with s elements. Special instan...