![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Non-interactive Zero-Knowledge Functional Proofs
In this paper, we consider to generalize NIZK by empowering a prover to share a witness in a fine-grained manner with verifiers. Roughly, the prover is able to authorize a verifier to obtain extra information ...
-
Chapter and Conference Paper
Leakage-Resilient Inner-Product Functional Encryption in the Bounded-Retrieval Model
We propose a leakage-resilient inner-product functional encryption scheme (IPFE) in the bounded-retrieval model (BRM). This is the first leakage-resilient functional encryption scheme in the BRM. In our leakag...
-
Chapter and Conference Paper
Adaptive-Secure Identity-Based Inner-Product Functional Encryption and Its Leakage-Resilience
There are lots of applications of inner-product functional encryption (IPFE). In this paper, we consider two important extensions of it. One is to enhance IPFE with access control such that only users with a p...
-
Chapter and Conference Paper
From Quadratic Functions to Polynomials: Generic Functional Encryption from Standard Assumptions
The “all-or-nothing” notion of traditional public-key encryptions is found to be insufficient for many emerging applications in which users are only allowed to obtain a functional value of the ciphertext witho...
-
Chapter and Conference Paper
A New Privacy-Preserving Searching Model on Blockchain
It will be convenient for users if there is a market place that sells similar products provided by different suppliers. In physical world, this may not be easy, in particular, if the suppliers are from differe...
-
Chapter and Conference Paper
Privacy-Preserving Disease Risk Test Based on Bloom Filters
Decreasing costs in genome sequencing have been paving the way for personalised medicine. An increasing number of individuals choose to undergo disease risk tests provided by medical units. However, it poses s...
-
Chapter and Conference Paper
An ORAM Scheme with Improved Worst-Case Computational Overhead
We construct a statistically secure ORAM with computational overhead of \(O(\log ^2N\log \log N)\) . Moreover, when accessing co...