Implementing information-theoretically secure oblivious transfer from packet reordering
| dc.contributor.author | Palmieri, Paolo | |
| dc.contributor.author | Pereira, Olivier | |
| dc.contributor.editor | Kim, Howon | |
| dc.contributor.funder | Fonds De La Recherche Scientifique - FNRS | en |
| dc.contributor.funder | Université Catholique de Louvain | en |
| dc.date.accessioned | 2017-09-22T10:47:41Z | |
| dc.date.available | 2017-09-22T10:47:41Z | |
| dc.date.issued | 2011-12 | |
| dc.date.updated | 2017-09-20T16:08:55Z | |
| dc.description.abstract | If we assume that adversaries have unlimited computational capabilities, secure computation between mutually distrusting players can not be achieved using an error-free communication medium. However, secure multi-party computation becomes possible when a noisy channel is available to the parties. For instance, the Binary Symmetric Channel (BSC) has been used to implement Oblivious Transfer (OT), a fundamental primitive in secure multi-party computation. Current research is aimed at designing protocols based on real-world noise sources, in order to make the actual use of information-theoretically secure computation a more realistic prospect for the future. In this paper, we introduce a modified version of the recently proposed Binary Discrete-time Delaying Channel (BDDC), a noisy channel based on communication delays. We call our variant Reordering Channel (RC), and we show that it successfully models packet reordering, the common behavior of packet switching networks that results in the reordering of the packets in a stream during their transit over the network. We also show that the protocol implementing oblivious transfer on the BDDC can be adapted to the new channel by using a different sending strategy, and we provide a functioning implementation of this modified protocol. Finally, we present strong experimental evidence that reordering occurrences between two remote Internet hosts are enough for our construction to achieve statistical security against honest-but-curious adversaries. | en |
| dc.description.sponsorship | Fonds De La Recherche Scientifique - FNRS (F.R.S.-FNRS); Université Catholique de Louvain (SCOOP Action de Recherche Concertées) | en |
| dc.description.status | Peer reviewed | en |
| dc.description.version | Accepted Version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Palmieri, P. and Pereira, O. (2012) 'Implementing Information-Theoretically Secure Oblivious Transfer from Packet Reordering', in Kim, H. (ed.) Information Security and Cryptology - ICISC 2011: 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 332-345, doi: 10.1007/978-3-642-31912-9_22 | en |
| dc.identifier.doi | 10.1007/978-3-642-31912-9_22 | |
| dc.identifier.endpage | 345 | en |
| dc.identifier.isbn | 978-3-642-31912-9 | |
| dc.identifier.journaltitle | Information Security and Cryptology - ICISC 2011: 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised Selected Papers | en |
| dc.identifier.startpage | 332 | en |
| dc.identifier.uri | https://hdl.handle.net/10468/4773 | |
| dc.language.iso | en | en |
| dc.publisher | Springer Berlin Heidelberg | en |
| dc.relation.ispartof | Information Security and Cryptology - ICISC 2011 - 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised Selected Papers | |
| dc.relation.uri | https://link.springer.com/chapter/10.1007/978-3-642-31912-9_22 | |
| dc.rights | © Springer-Verlag Berlin Heidelberg 2012. The final publication is available at Springer via https://doi.org/10.1007/978-3-642-31912-9_22 | en |
| dc.subject | Oblivious transfer | en |
| dc.subject | Secure multi-party computation | en |
| dc.subject | Noisy channels | en |
| dc.subject | Packet reordering | en |
| dc.subject | Delay | en |
| dc.title | Implementing information-theoretically secure oblivious transfer from packet reordering | en |
| dc.type | Conference item | en |
