Learn More
We present a practical interactive conference key distribution system based on public keys, which is 'proven' secure provided the Diffie-Hellman problem is intractable. The system authenticates the users and allows them to compute their own conference key. A certain number of interactions is required, but the number of rounds is independent of the number of(More)
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are " simultaneously " scanned by a reader device. Our goal is to study the group scanning problem in strong ad-versarial models. We present a security model for this application and give a formal description of the attending security requirements,(More)
Recently, a universally composable framework for RFID authentication protocols providing availability, anonymity, and authenticity was proposed. In this paper we extend that framework to address forward-security issues in the presence of key compromise.We also introduce new, provably secure, and highly practical protocols for anonymous authentication and(More)
We present a practical interactive conference key distribution system based on public keys, which is 'proven' secure provided the Diffie-Hellman problem is intractable. The system authenticates the users and allows them to compute their own conference key. A certain number of interactions is required, but the number of rounds is independent of the number of(More)
Mobile ad hoc networks (MANETs) are collections of wireless mobile devices with restricted broadcast range and resources, and no fixed infrastructure. Communication is achieved by relaying data along appropriate routes that are dynamically discovered and maintained through collaboration between the nodes. Discovery of such routes is a major task, both from(More)
As the number of RFID applications grows, concerns about their security and privacy become greatly amplified. At the same time, the acutely restricted and cost-sensitive nature of RFID tags rules out simple reuse of traditional security/privacy solutions and calls for a new generation of extremely lightweight identification and authentication protocols. (More)
This paper examines two unlinkably anonymous, simple RFID identification protocols that require only the ability to evaluate hash functions and generate random values, and that are provably secure against Byzantine adversaries. The main contribution is a universally composable security model tuned for RFID applications. By making specific setup,(More)
For an electronic election to be fully democratic there is a need for security mechanisms that will assure the privacy of the voters. With receipt-free electronic voting, a voter neither obtains nor is able to construct a receipt proving the content of her vote. In this paper we first consider the minimal requirements for receipt-free elections, without(More)