Conversion of real-numbered privacy-preserving problems into the integer domain

Simple item page
dc.contributor.authorHenecka, W.
dc.contributor.authorBean, N.
dc.contributor.authorRoughan, M.
dc.contributor.conference14th International Conference, ICICS 2012 (29 Oct 2012 - 31 Oct 2012 : Hong Kong, China)
dc.contributor.editorChim, T.W.
dc.contributor.editorYuen, T.H.
dc.date.issued2012
dc.description.abstractSecure Multiparty Computation (SMC) enables untrusting parties to jointly compute a function on their respective inputs without revealing any information but the outcome. Almost all techniques for SMC support only integer inputs and operations. We present a secure scaling protocol for two parties to map real number inputs into integers without revealing any information about their respective inputs. The main component is a novel algorithm for privacy-preserving random number generation. We also show how to implement the protocol using Yao’s garbled circuit technique.
dc.description.statementofresponsibilityWilko Henecka, Nigel Bean, and Matthew Roughan
dc.identifier.citationLecture Notes in Artificial Intelligence, 2012 / Chim, T.W., Yuen, T.H. (ed./s), vol.7618 LNCS, pp.131-141
dc.identifier.doi10.1007/978-3-642-34129-8_12
dc.identifier.isbn9783642341281
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.orcidBean, N. [0000-0002-5351-3104]
dc.identifier.orcidRoughan, M. [0000-0002-7882-7329]
dc.identifier.urihttp://hdl.handle.net/2440/88151
dc.language.isoen
dc.publisherSpringer
dc.relation.granthttp://purl.org/au-research/grants/arc/DP0985063
dc.relation.ispartofseriesLecture Notes in Computer Science; 7618
dc.rights© Springer-Verlag Berlin Heidelberg 2012
dc.source.urihttps://doi.org/10.1007/978-3-642-34129-8_12
dc.titleConversion of real-numbered privacy-preserving problems into the integer domain
dc.typeConference paper
pubs.publication-statusPublished

Files

Collections

Mathematical Sciences publications