Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures

DOI10.1007/978-3-642-03298-1_10MaRDI QIDQ3392908zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Advances in Cryptology – CRYPTO 2004
• P-signatures and Noninteractive Anonymous Credentials
• Fully Anonymous Group Signatures Without Random Oracles
• Anonymous Proxy Signatures
• Structure-preserving signatures and commitments to group elements

Cites work

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Anonymous Proxy Signatures
• Automata, Languages and Programming
• Compact Group Signatures Without Random Oracles
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Fully Anonymous Group Signatures Without Random Oracles
• Group Signatures
• scientific article; zbMATH DE number 1256680 (Why is no real title available?)
• scientific article; zbMATH DE number 1302845 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 2009983 (Why is no real title available?)
• Non-interactive Zaps and New Techniques for NIZK
• Optimistic fair exchange of digital signatures
• P-signatures and Noninteractive Anonymous Credentials
• Perfect Non-interactive Zero Knowledge for NP
• Secure proxy signature schemes for delegation of signing rights
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2005

Cited in

(10)

• Transferable e-cash: a cleaner model and the first practical instantiation
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Structure-preserving signatures and commitments to group elements
• Towards restricting plaintext space in public key encryption
• Multi-theorem preprocessing NIZKs from lattices
• Tracing a linear subspace: application to linearly-homomorphic group signatures
• On proving equivalence class signatures secure from non-interactive assumptions
• On security proofs of existing equivalence class signature schemes
• Linearly homomorphic structure-preserving signatures and their applications

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)