Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
From MaRDI portal
Publication:3392908
DOI10.1007/978-3-642-03298-1_10zbMATH Open1248.94104OpenAlexW1607335124MaRDI QIDQ3392908FDOQ3392908
Authors: Georg Fuchsbauer, David Pointcheval 
Publication date: 18 August 2009
Published in: Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03298-1_10
Recommendations
Cites Work
- Theory of Cryptography
- Efficient Identity-Based Encryption Without Random Oracles
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Anonymous Proxy Signatures
- Compact Group Signatures Without Random Oracles
- Group Signatures
- Secure proxy signature schemes for delegation of signing rights
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Fully Anonymous Group Signatures Without Random Oracles
- Advances in Cryptology - CRYPTO 2003
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Topics in Cryptology – CT-RSA 2005
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Non-interactive Zaps and New Techniques for NIZK
- Perfect Non-interactive Zero Knowledge for NP
- Optimistic fair exchange of digital signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Languages and Programming
Cited In (9)
- Towards restricting plaintext space in public key encryption
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Linearly homomorphic structure-preserving signatures and their applications
- Tracing a linear subspace: application to linearly-homomorphic group signatures
- On proving equivalence class signatures secure from non-interactive assumptions
- Multi-theorem preprocessing NIZKs from lattices
- Transferable e-cash: a cleaner model and the first practical instantiation
This page was built for publication: Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392908)
