搜索结果: 61-75 共查到“知识库 计算机工程”相关记录1101条 . 查询时间(2.417 秒)
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which builds an IBE based on the...
DNS rebinding attacks subvert the same-origin policy of browsers and convert them into open network proxies. We survey new DNS rebinding attacks that exploit the interaction between browsers and their...
Private Web Search
Private Web Search response
2015/8/5
Web search is currently a source of growing concern about personal privacy. It is an essential and central part of most users� activity online and therefore one through which a significant amou...
Exposing private information by timing web applications
web applications private information
2015/8/5
We show that the time web sites take to respond to HTTP requests can leak private information, using two different types of attacks. The first, direct timing directly measures response times from a we...
Cryptographic Methods for Storing Ballots on a Voting Machine
Voting Machine Storing Ballots
2015/8/5
A direct recording electronic (DRE) voting machine must satisfy several requirements to ensure voter privacy and the integrity of the election. A recent proposal for a vote storage system due to Molna...
We construct public-key systems that support comparison queries (x > a) on encrypted data as well as more general queries such as subset queries (x in S). These systems also support arbitrary conjunct...
On the impossibility of efficiently combining collision resistant hash functions
resistant hash functions efficiently combining
2015/8/5
Let H1, H2 be two hash functions. We wish to construct a new hash function H that is collision resistant if at least one of H1 or H2 is collision resistant. Concatenating the output of H1 and H2 clear...
Homomorphic Signatures for Polynomial Functions
Polynomial Functions Homomorphic Signatures
2015/8/5
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm t...
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slightly homomorphic signat...
Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
binary fields lattice-based signatures
2015/8/5
Our scheme can be used to authenticate linear transformations of signed data, such as those arising when computing mean and least squares fit or in networks that use network coding. Our construction g...
We study privacy-preserving tests for proximity: Alice can test if she is close to Bob without either party revealing any other information about their location. We describe several secure protocols t...
Algebraic pseudorandom functions with improved efficiency from the augmented cascade
improved efficiency pseudorandom functions
2015/8/5
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic Naor-Reingold algebraic PRF. Our PRF is the result of adapting the cascade construction, which is the basi...
Lattice basis delegation in fixed dimension and shorter ciphertext hierarchical IBE
ciphertext hierarchical IBE fixed dimensio
2015/8/5
We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct two new hierarchica...
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in the construction is...
We study the security and privacy of private browsing modes recently added to all major browsers. We first propose a clean definition of the goals of private browsing and survey its implementation in ...