搜索结果: 1-15 共查到“军事学 Efficiently”相关记录30条 . 查询时间(0.093 秒)
We present modifications to the MPC system SCALE-MAMBA to enable the evaluation of garbled circuit (GC) based MPC functionalities and Linear Secret Sharing (LSSS) based MPC functionalities along side ...
Efficiently Masking Binomial Sampling at Arbitrary Orders for Lattice-Based Crypto
Masking Post-quantum Cryptography
2019/8/8
With the rising popularity of lattice-based cryptography, the Learning with Errors (LWE) problem has emerged as a fundamental core of numerous encryption and key exchange schemes. Many LWE-based schem...
Subversion in Practice: How to Efficiently Undermine Signatures
cryptanalysis digital signatures implementation
2018/12/19
Algorithm substitution attack (ASA) on signatures should be treated seriously as the authentication services of numerous systems and applications rely on signature schemes and compromising them has a ...
Fast Scalar Multiplication for Elliptic Curves over Prime Fields by Efficiently Computable Formulas
twisted Edwards curves Edwards curves scalar multiplication
2018/11/6
This paper addresses fast scalar multiplication for elliptic curves over finite fields. In the first part of the paper, we obtain several efficiently computable formulas for basic elliptic curves arit...
Public-Key Encryption Resistant to Parameter Subversion and its Realization from Efficiently-Embeddable Groups
Public-key encryption subversion mass surveillance
2018/1/11
We initiate the study of public-key encryption (PKE) schemes and key-encapsulation mechanisms (KEMs) that retain security even when public parameters (primes, curves) they use may be untrusted and sub...
The Strength of Weak Randomization: Efficiently Searchable Encryption with Minimal Leakage
efficiently searchable encryption encrypted databases
2017/11/13
Efficiently searchable and easily deployable encryption schemes enable an untrusted, legacy service such as a relational database engine to perform searches over encrypted data. The ease with which su...
Fast Scalar Multiplication for Elliptic Curves over Binary Fields by Efficiently Computable Formulas
binary elliptic curves point multiplication lambda coordinates
2017/9/7
This paper considers efficient scalar multiplication of elliptic curves over binary fields with a twofold purpose. Firstly, we derive the most efficient 3P3P formula in λλ-projective coordinates and 5...
Determining the Nonexistent Terms of Non-linear Multivariate Polynomials: How to Break Grain-128 More Efficiently
Stream ciphers Grain-128 Polynomial reduction
2017/5/15
In this paper, we propose a reduction technique that can be used to determine the density of IV terms of a complex multivariable boolean polynomial. Using this technique, we revisit the dynamic cube a...
The Reason Why Some Divide-and-Conquer Algorithms Cannot Be Efficiently Implemented
divide-and-conquer algorithm data expansion merge sort
2016/12/8
In the literature there are some divide-and-conquer algorithms, such as
Karatsuba’s algorithm and Strassen’s algorithm, which play a key role in analyzing the
performance of some cryptographic proto...
We device a general secret sharing scheme for evolving access structures (following [KNY16]). Our scheme has (sub)exponentially smaller share complexity (share of ii'th party) for certain access struc...
Efficiently Enforcing Input Validity in Secure Two-party Computation
cryptographic protocols secure computation garbled circuit
2016/2/24
Secure two-party computation based on cut-and-choose has made great strides in recent
years, with a significant reduction in the total number of garbled circuits required. Nevertheless,
the overhead...
Efficiently Computing Data-Independent Memory-Hard Functions
Memory Hard Function Password Hashing Depth-Robust Graph
2016/2/23
A memory-hard function (MHF) f is equipped with a {\em space cost} σ and {\em time cost} τ parameter such that repeatedly computing fσ,τ on an application specific integrated circuit (ASIC) is not eco...
Efficiently Verifiable Computation on Encrypted Data
verifiable computation Fully Homomorphic Encryption homomorphic message authentication codes
2016/1/25
We study the task of verifiable delegation of computation on encrypted data. We improve
previous definitions in order to tolerate adversaries that learn whether or not clients accept the result
of a...
Extending Oblivious Transfer Efficiently, or - How to get active security with constant cryptographic overhead
Oblivious Transfer Extension
2016/1/7
On top of the passively secure extension protocol of [IKNP03] we build a new construction secure against active adversaries. We can replace the invocation of the hash function that is used to check th...
How to Efficiently Evaluate RAM Programs with Malicious Security
secure computation oblivious ram
2016/1/7
Secure 2-party computation (2PC) is becoming practical for some applications. However, most approaches are limited by the fact that the desired functionality must be represented as a boolean circuit. ...