Constant-Size Dynamic k-TAA

By Man Ho Allen Au, Willy Susilo, Yi Mu. International Conference on Security and Cryptography for Networks, 2006

324 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/03e187f67f6039c845057066b31c7c0fcd6732a3

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 Computer Networks and Communications

Citations in the corpus

An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, background): “It is described in [33] and has been proven secure under the n-SDH assumption [34, 35 ].”
One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries (2013, background): “…as such, Protocol 3 inherits the latter protocol’s rich feature set, which includes simultaneous support for (tiered) pricing and access control lists, and novel bookkeeping features like Top-K replication and multiple payees (see Henry et al.’s [28] paper for further details on these features).”
Short Randomizable Signatures (2016, methodology): “Although the eﬃciency of our scheme is similar to the one of BBS, we stress that the ability of our signatures to be randomized improves the eﬃciency of protocols using them.”
RingCT 2.0: A Compact Accumulator-Based (Linkable Ring Signature) Protocol for Blockchain Cryptocurrency Monero (2017, methodology): “By using the similar technique in [5], a prover knowing (wk, zk, rk) can compute this protocol by first computing quantities wk,1 = g τ1 0 g τ2 1 , wk,2 = wkg τ1 1 for some τ1, τ2 ← Zp, and then computing the following proof-of-knowledge protocol:”
How to win the clonewars: efficient periodic n-times anonymous authentication (2006, background): “Another set of recent papers [48, 49, 43, 3] addressed a related problem of allowing a user to show a credential anonymously and unlinkably up to k times to a particular verifier.”
Enhanced Privacy ID from Bilinear Pairing for Hardware Authentication and Attestation (2010, methodology): “In this subsection, we review a signature scheme that will be used in our EPID construction called BBS+ signature scheme (Au et al., 2006). This BBS+ signature scheme is a variant of Boneh-Boyen signature scheme (Boneh and Boyen, 2004). The idea of constructing this BBS+ signature scheme is informal”