We present a generic computational soundness result for interactive cryptographic primitives. Our abstraction of interactive primitives leverages the Universal Composability (UC) framework, and thereby offers strong composability properties for our computational soundness result: given a computationally sound Dolev-Yao model for non-interactive primitives, and given UC-secure interactive primit...

At Eurocrypt ’94, Stefano D’Amiano and Giovanni Di Crescenzo presented a protocol for untraceable electronic cash based on non-interactive zero-knowledge proofs of knowledge with preprocessing. It was supposed to be provably secure given this and a few other general cryptographic tools. We show that this protocol nevertheless does not provide any untraceability and has some further weaknesses. ...

People can access and obtain services from smart home devices conveniently through fog-enabled environments. The security privacy-preserving authentication protocol play an important role. However, many proposed protocols have one or more flaws. In particular, almost all the existing for cannot resist gateway compromised attacks. adversary not only know user’s identity but also launch impersona...

In this paper we propose a communication protocol for Radio Frequency Identification (RFID) systems that is based on the tags responding only to authenticated readers, otherwise tags always maintain RF silence. The protocol is practical from a deployment point of view and it not only meets the formal definitions of strong privacy and untraceability, but also addresses most, of the concerns rais...

Privacy is a major concern in RFID systems, especially with widespread deployment of wireless-enabled interconnected personal devices e.g. PDAs and mobile phones, credit cards, e-passports, even clothing and tires. An RFID authentication protocol should not only allow a legitimate reader to authenticate a tag but it should also protect the privacy of the tag against unauthorized tracing: an adv...

In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (TGDH) protocol suite, that consists of group key agreement protocols based on IDH key trees. Furthermore, we consider the anonymity of members during group communication over a public broadcast channel that provides unt...

Anonymous credentials are widely used to certify properties of a credential owner or to support the owner to demand valuable services, while hiding the user’s identity at the same time. A credential system (a.k.a. pseudonym system) usually consists of multiple interactive procedures between users and organizations, including generating pseudonyms, issuing credentials and verifying credentials, ...

This work introduces the most efficient universal accumulator known today. For the first time, we have an accumulator which does not depend on hidden order groups, does not require any exponentiations in the target group associated with the pairing function, and only requires two pairings to verify a proof-of-knowledge of a witness. We present implementations of our accumulator and another rece...

The design of secure grouping-proof protocol is imperative to the pervasive deployment of low-cost RFIDs, though many protocols have been published recently. In this paper, we analyze the security vulnerabilities of a scalable grouping-proof protocol for RFID tags based on Shamir’s (n, n) secret sharing proposed by Dang and Kwangjo in 2009. This protocol attempts to alleviate many security weak...

Personal information anonymity concerns anonymizing information that identifies individuals, in contrast to anonymizing activities such as downloading copyrighted items on the Internet. It may refer to encrypting personal data, generalization and suppression as in k-anonymization, ‘untraceability’ or ‘unidentifiability’ of identity in the network, etc. A common notion is hiding the “identities”...