Cryptology ePrint Archive: Report 2014/1004

CONIKS: Bringing Key Transparency to End Users

Marcela S. Melara and Aaron Blankstein and Joseph Bonneau and Edward W. Felten and Michael J. Freedman

Abstract: We present CONIKS, an end-user key verification service capable of integration in end-to-end encrypted communication systems. CONIKS builds on transparency log proposals for web server certificates but solves several new challenges specific to key verification for end users. CONIKS obviates the need for global third-party monitors and enables users to efficiently monitor their own key bindings for consistency, downloading less than 20 kB per day to do so even for a provider with billions of users. CONIKS users and providers can collectively audit providers for non-equivocation, and this requires downloading a constant 2.5 kB per provider per day. Additionally, CONIKS preserves the level of privacy offered by today’s major communication services, hiding the list of usernames present and even allowing providers to conceal the total number of users in the system.

Category / Keywords: Public key verification, key transparency, end-to-end secure communication

Original Publication (in the same form): USENIX Security '15

Date: received 17 Dec 2014, last revised 27 Apr 2017

Contact author: melara at cs princeton edu

Available format(s): PDF | BibTeX Citation

Note: Revision to correct security error in the VRF scheme: Earlier versions of this paper reproduced an error contained in the scheme in Franklin and Zhang’s original paper. It has since been fixed in Franklin and Zhang’s paper as well as this paper. Thanks to Sharon Goldberg and Leonid Reyzin for finding this error.

Version: 20170427:193044 (All versions of this report)

Short URL: ia.cr/2014/1004

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]