Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
50
views
7
references
Top references
cited by
31
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,517
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — CRYPTO 2000
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
other
Author(s):
Giuseppe Ateniese
,
Jan Camenisch
,
Marc Joye
,
Gene Tsudik
Publication date
(Online):
August 11 2000
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Future Science Group
Most cited references
7
Record
: found
Abstract
: not found
Book Chapter
: not found
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Niko Barić
,
Birgit Pfitzmann
(1997)
0
comments
Cited
61
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Jan Camenisch
,
Markus Michels
(1999)
0
comments
Cited
31
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Identity escrow
Joe Kilian
,
Erez Petrank
(1998)
0
comments
Cited
27
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2000
Publication date (Online):
August 11 2000
Pages
: 255-270
DOI:
10.1007/3-540-44598-6_16
SO-VID:
ab39937d-13f5-460c-8bc3-6fd36e613b69
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
The XTR Public Key System
pp. 20
A Chosen-Ciphertext Attack against NTRU
pp. 55
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
pp. 74
Parallel Reducibility for Information-Theoretically Secure Computation
pp. 93
Optimistic Fair Secure Computation
pp. 112
A Cryptographic Solution to a Game Theoretic Problem
pp. 131
Differential Fault Attacks on Elliptic Curve Cryptosystems
pp. 147
Quantum Public-Key Cryptosystems
pp. 197
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
pp. 229
On the Exact Security of Full Domain Hash
pp. 236
Timed Commitments
pp. 255
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
pp. 271
Provably Secure Partially Blind Signatures
pp. 300
Fast Correlation Attacks through Reconstruction of Linear Polynomials
pp. 333
Long-Lived Broadcast Encryption
pp. 359
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
pp. 376
On the Round Security of Symmetric-Key Cryptographic Primitives
pp. 413
Efficient Non-malleable Commitment Schemes
pp. 432
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
pp. 482
Linking Classical and Quantum Key Agreement: Is There “Bound Information”?
pp. 515
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
Similar content
3,517
The G20 at the Cancun Ministerial: Developing Countries and Their Evolving Coalitions in the WTO
Authors:
Amrita Narlikar
,
Diana Tussie
Conditional commitments: Why states use caveats to reserve their efforts in military coalition operations
Authors:
Per Marius Frost-Nielsen
Bone stress injuries in the presence of tarsal coalition as a cause of hindfoot pain in adolescents: case series of 6 patients with literature review.
Authors:
V K Jain
,
Karthikeyan P Iyengar
,
Rajesh Botchu
See all similar
Cited by
82
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Authors:
Jan Camenisch
,
Victor Shoup
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Authors:
Jens Groth
Accumulators from Bilinear Pairings and Applications
Authors:
Lan Nguyen
See all cited by