搜索结果: 1-13 共查到“军事学 Multi-Client”相关记录13条 . 查询时间(0.089 秒)
Multi-client Secure Encrypted Search Using Searching Adversarial Networks
Searchable Encryption Multi-keyword Ranked Search Multi-owner Model
2019/8/8
With the rapid development of cloud computing, searchable encryption for multiple data owners model (multi-owner model) draws much attention as it enables data users to perform searches on encrypted c...
Multi-Client Symmetric Searchable Encryption with Forward Privacy
Cloud Security Forward Privacy Multi-Client Symmetric Searchable Encryption
2019/7/15
Symmetric Searchable encryption (SSE) is an encryption technique that allows users to search directly on their outsourced encrypted data, in a way that the privacy of both the files and the search que...
From Single-Input to Multi-Client Inner-Product Functional Encryption
Decentralized multi-client functional encryption inner products
2019/5/21
We present a new generic construction of multi-client functional encryption (MCFE) for inner products from single-input functional inner-product encryption and standard pseudorandom functions. In spit...
Multi-Client Functional Encryption with Repetition for Inner Product
Functional Encryption Inner Product Multi-Client
2018/11/2
Recently, Chotard et al. proposed a variant of functional encryption for Inner Product, where several parties can independently encrypt inputs, for a specific time-period or label, such that functiona...
Multi-client Predicate-only Encryption for Conjunctive Equality Tests
multi-client functional encryption predicate-only encryption privacy-preserving multi-client monitoring
2018/6/5
We propose the first multi-client predicate-only encryption scheme capable of efficiently testing the equality of two encrypted vectors. Our construction can be used for the privacy-preserving monitor...
Decentralized Multi-Client Functional Encryption for Inner Product
Functional Encryption Inner Product Private Stream Aggregation
2017/10/12
Multi-input functional encryption is a very useful generalization of Functional Encryption, which has been motivated by Goldwasser et al. from Eurocrypt ’14. All the constructions, however, rely on no...
Stateful Multi-Client Verifiable Computation
Byzantine emulation verifiable computation authenticated data types
2017/9/25
This paper develops a cryptographic protocol for outsourcing arbitrary stateful computation among multiple clients to an untrusted server, while guaranteeing integrity of the data. The clients communi...
Oblivious RAM (ORAM) has emerged as an enabling technology to secure cloud-based storage services. The goal of this cryptographic primitive is to conceal not only the data but also the access patterns...
An Efficient Non-Interactive Multi-client Searchable Encryption with Support for Boolean Queries
cloud storage searchable encryption non-interaction
2016/12/7
Motivated by the recent searchable symmetric encryption protocol of Cash et al., we propose
a new multi-client searchable encryption protocol in this work. By tactfully leveraging the RSA-function,
...
Blurry-ORAM: A Multi-Client Oblivious Storage Architecture
Path-ORAM Oblivious storage multiple clients
2016/12/7
Since the development of tree-based Oblivious RAM by Shi et al. (Asiacrypt '11) it has become apparent that privacy preserving outsourced storage can be practical. Although most current constructions ...
Multi-Client Oblivious RAM secure against Malicious Servers
cryptographic protocols oblivious ram
2016/1/4
It has been an open question whether Oblivious RAM stored on a malicious
server can be securely shared among multiple clients. The challenge is
that ORAMs are stateful, and clients would need to exc...
Multi-Client Verifiable Computation with Stronger Security Guarantees
Verifiable Computation Attribute-based Encrpytion Functional Encryption
2016/1/4
Choi et al. (TCC 2013) introduced the notion of multi-client verifiable computation (MVC)
in which a set of clients outsource to an untrusted server the computation of a function f over
their collec...
Gennaro et al.\ (Crypto 2010) introduced the notion of \emph{non-interactive verifiable computation}, which allows a computationally weak client to outsource the computation of a function f on a serie...