搜索结果: 1-15 共查到“军事学 Subset”相关记录30条 . 查询时间(0.078 秒)
Low Weight Discrete Logarithms and Subset Sum in 20.65n with Polynomial Memory
Low weight dlog subset sum representations Nested Rho
2019/8/19
We propose two polynomial memory collision finding algorithms for the low Hamming weight discrete logarithm problem in any abelian group GG. The first one is a direct adaptation of the Becker-Coron-Jo...
A Generic Construction for Revocable Identity-Based Encryption with Subset Difference Methods
Revocable identity-based encryption Subset difference method Generic construction
2019/7/15
To deal with dynamically changing user's credentials in identity-based encryption (IBE), providing an efficient key revocation method is a very important issue. Recently, Ma and Lin proposed a generic...
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
time-memory trade-off representations parallel collision search
2019/7/15
For enabling post-quantum cryptanalytic experiments on a meaningful scale, there is a strong need for low-memory algorithms. We show that the combination of techniques from representations, multiple c...
Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems
Program Obfuscation Hamming Distance Conjunctions
2019/6/4
We consider the problem of obfuscating programs for fuzzy matching (in other words, testing whether the Hamming distance between an nn-bit input and a fixed nn-bit target vector is smaller than some p...
Large Universe Subset Predicate Encryption Based on Static Assumption (without Random Oracle)
Predicate Encryption Adaptive Security Standard Model
2018/12/11
In a recent work, Katz et al. (CANS'17) generalized the notion of Broadcast Encryption to define Subset Predicate Encryption (SPE) that emulates \emph{subset containment} predicate in the encrypted do...
LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE
Binary matrix LWE Linear Programming Cryptanalysis
2018/8/16
We consider Galbraith's space efficient LWE variant, where the (m×n)(m×n)-matrix AA is binary. In this binary case, solving a vectorial subset sum problem over the integers allows for decryption. We s...
Iterative collision search procedures play a key role in developing combinatorial algorithms for the subset sum and learning parity with noise (LPN) problems. In both scenarios, the single-list pair-w...
We investigate the subset-resilience problem, defined in 2002 by Reyzin and Reyzin to analyze their HORS signature scheme. We show that textbook HORS is insecure against adaptive attacks, and present ...
Combinatorial Subset Difference Public Key Broadcast Encryption Scheme for Secure Multicast
broadcast encryption secure multicast wildcard
2017/5/15
Public key broadcast encryption is a cryptographic method to securely transmit a message from anyone to a group of receivers such that only privileged users can decrypt it. A secure multicast system a...
Enhanced Outsider-anonymous Broadcast Encryption with Subset Difference Revocation
anonymous broadcast encryption outsider anonymity ternary subset difference
2017/3/27
This paper puts forward an efficient broadcast encryption in public key setting employing ternary tree subset difference method for revocation. It provides outsider anonymity disabling the revoked use...
Chosen-Ciphertext Security from Subset Sum
public-key cryptography chosen-ciphertext security subset sum
2016/1/27
We construct a public-key encryption (PKE) scheme whose
security is polynomial-time equivalent to the hardness of the Subset Sum
problem. Our scheme achieves the standard notion of indistinguishabil...
Solving Random Subset Sum Problem by $l_{p}$-norm SVP Oracle
SVP random subset sum problems lattice
2016/1/26
SHipher: Families of Block Ciphers based on SubSet-Sum Problem
Block cipher SubSet-Sum problem Framework
2016/1/25
In this paper, we describe the families of block ciphers named SHipher. We
show a symmetric encryption framework based on the SubSet-Sum problem.
This framework can provide families of secure, flexi...
Efficient Revocable Identity-Based Encryption via Subset Difference Methods
Identity-based encryption Revocable identity-based encryption Key revocation
2016/1/25
Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important
since a user’s credential (or private key) can be expired or revealed. Revocable IBE (RIBE) is an ext...
Reducing Communication Overhead of the Subset Difference Scheme
Broadcast encryption subset difference trees
2016/1/8
In Broadcast Encryption (BE) systems like Pay-TV, AACS, online content sharing and broadcasting, reducing
the header length (communication overhead per session) is of practical interest. The Subset D...