搜索结果: 1-15 共查到“军队指挥学 vector”相关记录46条 . 查询时间(0.125 秒)
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...
Anomalies and Vector Space Search: Tools for S-Box Reverse-Engineering
Reverse-engineering Vector space search BCT
2019/5/21
S-boxes are functions with an input so small that the simplest way to specify them is their lookup table (LUT). Unfortunately, some algorithm designers exploit this fact to avoid providing the algorit...
Oblivious PRF on Committed Vector Inputs and Application to Deduplication of Encrypted Data
public-key cryptography applications pseudo-random functions
2019/5/5
Ensuring secure deduplication of encrypted data is a very active topic of research because deduplication is effective at reducing storage costs. Schemes supporting deduplication of encrypted data that...
Oblivious linear-function evaluation (OLE) is a secure two-party protocol allowing a receiver to learn a secret linear combination of a pair of field elements held by a sender. OLE serves as a common ...
On the Inner Product Predicate and a Generalization of Matching Vector Families
Predicate Encryption Inner Product Encoding Matching Vector Families
2018/11/7
Our main result is a simple lower bound that allows us to show that known encodings for many predicates considered in the cryptographic literature such as greater than and threshold are essentially op...
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
lattice basis reduction massive parallelization shortest vector problem
2018/1/11
The hardness of the shortest vector problem for lattices is a fundamental assumption underpinning the security of many lattice-based cryptosystems, and therefore, it is important to evaluate its diffi...
On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications
trapdoor function CVP lattice
2017/10/16
In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closes...
Shortest Vector from Lattice Sieving: a Few Dimensions for Free
Cryptanalysis Lattice Sieving
2017/10/12
Asymptotically, the best known algorithms for solving the Shortest Vector Problem (SVP) in a lattice of dimension nn are sieve algorithms, which have heuristic complexity estimates ranging from (4/3)n...
Image Classification using non-linear Support Vector Machines on Encrypted Data
cryptographic protocols SHE
2017/9/13
In image processing, algorithms for object classification are typically based around machine learning. From the algorithm developer's perspective, these can involve a considerable amount of effort and...
Lightweight Symmetric-Key Hidden Vector Encryption without Pairings
Hidden Vector Encryption Symmetric-Key Simulation-Security
2017/8/28
Hidden vector encryption (HVE), introduced by Boneh and Waters in TCC'07, is an expressive sub-class of predicate encryption, that allows conjunctive, subset, range and comparison queries over encrypt...
In this work, we design a new lattice encoding structure for vectors. Our encoding can be used to achieve a packed FHE scheme that allows some SIMD operations and can be used to improve all the prior ...
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices
Lattices Bounded Distance Decoding Problem Unique Shortest Vector Problem
2016/12/12
We present a probabilistic polynomial-time reduction from the lattice Bounded Distance Decoding (BDD) problem with parameter 1/(2√⋅γ2⋅γ) to the unique Shortest Vector Problem (uSVP) with p...
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
Lattices zero-knowledge proofs group encryption anonymity
2016/12/9
Group encryption (GE) is the natural encryption analogue of group signatures in that it allows verifiably encrypting messages for some anonymous member of a group while providing evidence that the rec...
Randomized lattice sieving for the closest vector problem (with preprocessing)
lattices sieving algorithms nearest neighbor searching
2016/12/9
In practice, the large memory footprint makes it problematic to run sieving directly on high-dimensional lattices, and perhaps the most promising application of such algorithms is as part of a hybrid ...
The closest vector problem in tensored root lattices of type A and in their duals
Lattice based cryptography Cyclotomic lattices Tensored root lattices
2016/12/9
The closest vector problem in tensored root lattices of type A and in their duals.