[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Li et al., 2007 - Google Patents

Universal accumulators with efficient nonmembership proofs

Li et al., 2007

View PDF
Document ID
1588734535154957292
Author
Li J
Li N
Xue R
Publication year
Publication venue
Applied Cryptography and Network Security: 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007. Proceedings 5

External Links

Snippet

Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumulator and to efficiently compute a membership witness of any value that has been …
Continue reading at www.academia.edu (PDF) (other versions)

Similar Documents

Publication Publication Date Title
Li et al. Universal accumulators with efficient nonmembership proofs
Morais et al. A survey on zero knowledge range proofs and applications
Camenisch et al. Dynamic accumulators and application to efficient revocation of anonymous credentials
Camenisch et al. An accumulator based on bilinear maps and efficient revocation for anonymous credentials
Boneh et al. Using level-1 homomorphic encryption to improve threshold DSA signatures for bitcoin wallet security
Brickell et al. A new direct anonymous attestation scheme from bilinear maps
Camenisch et al. A signature scheme with efficient protocols
Brickell et al. Enhanced privacy ID from bilinear pairing for hardware authentication and attestation
Tsudik et al. Accumulating composites and improved group signing
Ge et al. A direct anonymous attestation scheme for embedded devices
Brickell et al. Enhanced privacy ID from bilinear pairing
Au et al. Constant-size dynamic k-times anonymous authentication
Au et al. Compact e-cash from bounded accumulator
Zhou et al. Shorter verifier-local revocation group signatures from bilinear maps
Chow et al. Generic construction of (identity-based) perfect concurrent signatures
EP2384562B1 (en) Management of cryptographic credentials in data processing systems
Derler et al. Short double-and n-times-authentication-preventing signatures from ECDSA and more
Camenisch et al. An identity escrow scheme with appointed verifiers
Canard et al. List signature schemes
Islam et al. Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing
Chu et al. Efficient k-out-of-n Oblivious Transfer Schemes.
Han et al. An efficient identity-based group signature scheme over elliptic curves
Wei Tracing-by-linking group signatures
EP2384563B1 (en) Verification of data items in data processing systems
Lian et al. Provably secure E-cash system with practical and efficient complete tracing