In this paper we propose a new construction for untraceable tags. Our construction is the first construction in the symmetric bilinear setting based on a mild assumption. That is our assumption is tautological in the generic group model and is ``efficiently falsifiable'' in the sense that its problem instances are stated non-interactively and concisely (i.e., independently of the number of adversarial queries and other large quantities).
Category / Keywords: public-key cryptography / RFID, untraceable tags Publication Info: Full version of the paper accepted at SETOP 2009 (International Workshop on Autonomous and Spontaneous Security) Date: received 3 Aug 2009, last revised 3 Aug 2009 Contact author: carblu at dia unisa it Available format(s): PDF | BibTeX Citation Version: 20090803:195229 (All versions of this report) Short URL: ia.cr/2009/380