搜索结果: 1-15 共查到“知识库 军事学 matching”相关记录22条 . 查询时间(0.105 秒)
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...
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards
obfuscation generic group virtual black box
2018/3/5
We give a simple and efficient method for obfuscating pattern matching with wildcards. In other words, we construct a way to check an input against a secret pattern, which is described in terms of pre...
SWiM: Secure Wildcard Pattern Matching From OT Extension
Pattern Matching Oblivious Transfer PRF
2017/11/28
Suppose a server holds a long text string and a receiver holds a short pattern string. Secure pattern matching allows the receiver to learn the locations in the long text where the pattern appears, wh...
Pattern Matching on Encrypted Streams: Applications to DPI and searches on genomic data
searchable encryption pattern-matching cloud computing
2017/2/23
Pattern matching is essential to applications such as filtering content in Data streams, searching on genomic data, and searching for correlation in medical data. However, increasing concerns of user ...
We construct efficient protocols for several tasks related to private matching of
k-mers (sets of k length strings). These are based upon the evaluation of functionalities
in the levelled homomorphi...
When a group of individuals and organizations wish to compute a stable matching---for example, when medical students are matched to medical residency programs---they often outsource the computation to...
Secure Error-Tolerant Graph Matching Protocols
Secure two-partycomputation Graph edit distance Privacy
2016/12/9
We consider a setting where there are two parties, each party holds a private graph and they wish to jointly compute the structural dissimilarity between two graphs without revealing any information a...
Secure and Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
private fingerprint authentication oblivious algorithm maximum flow
2016/1/8
The increasing availability and use of biometric data for authentication and other purposes
leads to situations when sensitive biometric data is to be handled or used in computation by
entities who ...
Outsourced Pattern Matching
pattern matching delegatable computation simulation-based security
2016/1/7
In secure delegatable computation, computationally weak devices (or clients) wish to outsource their
computation and data to an untrusted server in the cloud. While most earlier work considers the ge...
Attacking PUF-Based Pattern Matching Key Generators via Helper Data Manipulation
secret key helper data
2014/3/10
Physically Unclonable Functions (PUFs) provide a unique signature for integrated circuits (ICs), similar to a fingerprint for humans. They are primarily used to generate secret keys, hereby exploiting...
Today biometric data propagate more heavily into our lives. With more ubiquitous use of such data, computations over biometrics become more prevalent as well. While it is well understood that privacy ...
Privacy-Preserving Matching Protocols for Attributes and Strings
privacy-preserving attribute matching longest common sub-string elliptic curve cryptosystem
2010/2/20
In this technical report we present two new privacy-preserving matching protocols for singular attributes and strings, respectively. The first one is used for matching of common attributes without rev...
Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security
Privacy preserving Set operations Multiparty Computation
2009/7/14
In this paper, we focus on the specific problems of Private Matching, Set Disjointness and
Cardinality Set Intersection in information theoretic settings. Specifically, we give perfectly secure proto...
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Efficient Protocols Set Intersection Pattern Matching Malicious and Covert Adversaries
2009/6/11
In this paper we construct efficient secure protocols for set intersection and pattern match-
ing. Our protocols for securely computing the set intersection functionality are based on secure
pseudor...
A protocol for K-multiple substring matching
protocol K-multiple substring matching Verifier
2009/6/5
A protocol is introduced to show K copies of a pattern string are em-
bedded is a host string. Commitments to both strings, and to offsets of
copies of the pattern in the host is input of Verifier. ...