Direct anonymous attestation

By Ernie Brickell, Jan Camenisch, Liqun Chen. Conference on Computer and Communications Security, 2004

1,033 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/60739cb3e92415cff6f76a34374045d3f5cb6f27

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

Charm: a framework for rapidly prototyping cryptosystems (2013, neutral): “Such proofs are common in privacy-preserving protocols such as the idemix anonymous credential system and Direct Anonymous Attestation [23, 19].”
Secure Multiparty Computation from SGX (2017, methodology): “Provable security of realistic protocols that use trusted hardware-based protocols based on the Trusted Platform Module (TPM) have been considered in [11,37,10,21,20].”
Efficient and robust pseudonymous authentication in VANET (2007, background): “, [7, 31, 13, 11], with formal definitions in [8, 9].”
Formal Abstractions for Attested Execution Secure Processors (2017, methodology): “Secure processors such as SGX rely on group signatures and other anonymous credential techniques [15, 16] to offer “anonymous attestation”.”
Short Randomizable Signatures (2016, background): “Let us consider a typical situation for anonymous credentials [17], direct anonymous attestations [15], or group signatures [24]: a user first gets a signature σ on some secret value s and then has to prove, several times, that s is certified still keeping the proofs unlinkable.”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, background): “Moreover, the compiler overcomes various restrictions of previous approaches, e.g., it supports the important class of exponentiation homomorphisms with hidden-order co-domain, needed for privacypreserving applications such as DAA.”
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, background): “The first kind is called verifier local revocation [13,14, 11 ,15].”
Automated Synthesis of Privacy-Preserving Distributed Applications (2011, methodology): “We proved that the implementations output by the compiler enforce the intended authorization policies and we conducted an experimental evaluation to demonstrate the feasibility of our approach.”
Keystone: an open framework for architecting trusted execution environments (2020, background): “Key distribution [15], revocation [46], attestation services [49], and anonymous attestation [26] are orthogonal challenges.”