搜索结果: 1-15 共查到“军事学 Optimizing”相关记录20条 . 查询时间(0.062 秒)
Optimizing Transport Layer for Secure Computation
Framework Transport layer Garbled circuits Implementation
2019/7/22
Transport layer: Although significantly improved, the performance of 2PC is still prohibitive for practical systems. Contrary to the common belief that bandwidth is the remaining bottleneck for 2PC im...
Rate-Optimizing Compilers for Continuously Non-Malleable Codes
non-malleable codes tamper-proof security
2019/1/26
For the case of split-state tampering, we establish the existence of rate-one continuously non-malleable codes with computational security, in the (non-programmable) random oracle model. We further ex...
Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
Elliptic curves isogenies circuits
2018/11/5
Choosing safe post-quantum parameters for the new CSIDH isogeny-based key-exchange system requires concrete analysis of the cost of quantum attacks. The two main contributions to attack cost are the n...
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
secure two-party computation malicious security
2018/6/7
Wang et al. (CCS 2017) recently proposed a protocol for malicious secure two-party computation that represents the state-of-the- art with regard to concrete efficiency in both the single-execution and...
Optimizing polynomial convolution for NTRUEncrypt
Quantum-safe cryptography NTRUEncrypt security estimation
2018/3/5
NTRUEncrypt is one of the most promising candidates for quantum-safe cryptography. In this paper, we focus on the NTRU743 paramter set. We give a report on all known attacks against this parameter set...
Searchable symmetric encryption (SSE) enables data owners to conduct searches over encrypted data stored by an untrusted server, retrieving only those encrypted files that match the search queries. Se...
PermuteRam: Optimizing Oblivious Computation for Efficiency
oblivious execution permutation
2017/9/18
Privacy preserving computation is gaining importance. Along with secure computation guarantees, it is essential to hide information leakage through access patterns. Input-oblivious execution is a secu...
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
secure computation homomorphic secret sharing share conversion
2017/2/23
A recent work of Boyle et al. (Crypto 2016) suggests that ``group-based'' cryptographic protocols, namely ones that only rely on a cryptographically hard (Abelian) group, can be surprisingly powerful....
We study the synthesis of small functions used as building blocks in lightweight cryptographic designs in terms of hardware implementations. This phase most notably appears during the ASIC implementat...
Optimizing Secure Computation Programs with Private Conditionals
languages for secure computation static analysis graph theory
2016/12/8
Secure multiparty computation platforms are often provided with a programming language that allows
to write privacy-preserving applications without thinking of the underlying cryptography. The contro...
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
secure multiparty computation semi-honest adversaries constant-round protocols
2016/12/7
In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade, t...
Optimizing S-box Implementations for Several Criteria using SAT Solvers
S-box SAT solvers implementation optimization
2016/2/25
We explore the feasibility of applying SAT solvers to optimizing
implementations of small functions such as S-boxes for multiple
optimization criteria, e.g., the number of nonlinear gates and the nu...
Optimizing Obfuscation: Avoiding Barrington's Theorem
natural function classes Optimizing Obfuscation
2016/1/23
In this work, we seek to optimize the efficiency of secure general-purpose obfuscation schemes. We focus on the problem of optimizing the obfuscation of Boolean formulas and branching programs – thi...
Optimizing Information Set Decoding Algorithms to Attack Cyclosymmetric MDPC Codes
information set decoding code-based cryptography
2016/1/9
The most important drawback to code-based cryptography
has historically been its large key sizes. Recently, several promising approaches
have been proposed to reduce keysizes. In particular, signifi...
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-wise Tampering and Permutations
Non-malleable Codes Explicit Construction Information Theoretic
2016/1/6
A non-malleable code protects messages against a class of tampering functions. Informally,
a code is non-malleable if the effect of applying any tampering function on an encoded message
is to either...