Cryptology ePrint Archive: Report 2009/286

On Privacy Losses in the Trusted Agent Model (Abstract)

Paulo Mateus and Serge Vaudenay

Abstract: Tamper-proof devices are pretty powerful. They typically make security applications simpler (provided that the tamper-proof assumption is not violated). For application requiring privacy, we observe that some properties may become harder (if possible at all) to achieve when devices are maliciously used. We take the example of deniability, receipt-freeness, and anonymity.

We formalize the trusted agent model which assumes tamper-proof hardware in a way which captures the notion of programmable secure hardware. This model defines a functionality relative to which deniability requires provers to use a tamper proof hardware. Otherwise, any asymmetric situation in which the malicious verifiers have more powerful tamper-proof devices than the honest ones makes deniability impossible.

We conclude by observing that the ability to put boundaries in computing devices prevents from providing full control on how private information spreads: the concept of sealing a device is in some sense incompatible with some privacy notions.

Category / Keywords: foundations / tamper-proof resistance, setup assumptions

Publication Info: Presented as a poster at EUROCRYPT'09. Follow up publication at CHES'09.

Date: received 16 Jun 2009, last revised 16 Jun 2009

Contact author: serge vaudenay at epfl ch

Available format(s): PDF | BibTeX Citation

Version: 20090616:201725 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]