Publications
Chosen filters:
Chosen filters:
An MPC-based Protocol for Secure and Privacy-Preserving Smart Metering KU Leuven
© 2017 IEEE. In this paper we propose a novel protocol that allows suppliers and grid operators to collect users' electricity metering data in a secure and privacy-preserving manner, based on secure multiparty computation. Our protocol is designed for a realistic scenario where the data need to be sent to various parties, such as grid operators and suppliers, and users can switch supplier at any point in time. It also facilitates an accurate ...
SePCAR: A Secure and Privacy-Enhancing Protocol for Car Access Provision KU Leuven
© 2017, Springer International Publishing AG. We present an efficient secure and privacy-enhancing protocol for car access provision, named SePCAR. The protocol is fully decentralised and allows users to share their cars conveniently without sacrifising their security and privacy. It provides generation, update, revocation, and distribution mechanisms for access tokens to shared cars, as well as procedures to solve disputes and to deal with law ...
A Privacy-Preserving Model for Biometric Fusion KU Leuven
Biometric designs have attracted attention in practical technological schemes with high requirements in terms of accuracy, security and privacy. Nevertheless, multimodalities have been approached with skepticism, as fusion deployments are affected by performance metrics. In this paper, we introduce a basic fusion model blueprint for a privacy-preserving cloud-based user verification/authentication. We consider the case of three modalities, ...
An MPC-based Privacy-Preserving Protocol for a Local Electricity Trading Market KU Leuven
© Springer International Publishing AG 2016. This paper proposes a decentralised and privacy-preserving local electricity trading market. The market employs a bidding protocol based on secure multiparty computation and allows users to trade their excess electricity among themselves. The bid selection and trading price calculation are performed in a decentralised and privacy-preserving manner. We implemented the market in C++ and tested its ...
Efficient Verifiable Computation of XOR for Biometric Authentication KU Leuven
© Springer International Publishing AG 2016. This work addresses the security and privacy issues in remote biometric authentication by proposing an efficient mechanism to verify the correctness of the outsourced computation in such protocols. In particular, we propose an efficient verifiable computation of XORing encrypted messages using an XOR linear message authentication code (MAC) and we employ the proposed scheme to build a biometric ...
Practically Efficient Secure Single-Commodity Multi-Market Auctions KU Leuven
© International Financial Cryptography Association 2017. We study the problem of securely building single-commodity multi-markets auction mechanisms. We introduce a novel greedy algorithm and its corresponding privacy preserving implementation using secure multi-party computation. More specifically, we determine the quantity of supply and demand bids maximizing welfare. Each bid is attached to a specific market, but exchanges between different ...
Securely solving classical network flow problems KU Leuven
© Springer International Publishing Switzerland 2015. We investigate how to solve several classical network flow problems using secure multi-party computation. We consider the shortest path problem, the minimum mean cycle problem and the minimum cost flow problem. To the best of our knowledge, this is the first time the two last problems have been addressed in a general multi-party computation setting. Furthermore, our study highlights the ...
Securely solving simple combinatorial graph problems KU Leuven
We investigate the problem of solving traditional combinatorial graph problems using secure multi-party computation techniques, focusing on the shortest path and the maximum flow problems. To the best of our knowledge, this is the first time these problems have been addressed in a general multi-party computation setting. Our study highlights several complexity gaps and suggests the exploration of various trade-offs, while also offering protocols ...