Unique Group Signatures

No abstract is available for this paper.

• Publication year

  2012

• Venue

  European Symposium on Research in Computer Security

• Publication date

  2012-09-10

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-33167-1_37
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Framework for Unique Ring Signatures

  2012cited by this paper
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups

  2011cited by this paper
• Sub-linear Size Traceable Ring Signatures without Random Oracles

  2011cited by this paper
• Constructing Verifiable Random Functions with Large Input Spaces

  2010cited by this paper
• Structure-Preserving Signatures and Commitments to Group Elements

  2010cited by this paper
• k-Times Anonymous Authentication

  2009cited by this paper
• Weak Verifiable Random Functions

  2009cited by this paper
• Compact E-Cash and Simulatable VRFs Revisited

  2009cited by this paper
• Verifiable Random Functions from Identity-Based Key Encapsulation

  2009cited by this paper
• Real Traceable Signatures

  2009cited by this paper
• Efficient traceable signatures in the standard model

  2009cited by this paper
• Automorphic Signatures in Bilinear Groups and an Application to Round-Optimal Blind Signatures

  2009cited by this paper
• P-signatures and Noninteractive Anonymous Credentials

  2008cited by this paper
• Efficient Noninteractive Proof Systems for Bilinear Groups

  2008cited by this paper
• Universally Composable Adaptive Oblivious Transfer

  2008cited by this paper
• Pairings for Cryptographers

  2008cited by this paper
• Fully Anonymous Group Signatures without Random Oracles

  2007cited by this paper
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures

  2007cited by this paper
• Simulatable VRFs with Applications to Multi-theorem NIZK

  2007cited by this paper
• Efficient Two-Party Secure Computation on Committed Inputs

  2007cited by this paper
• Traceable Ring Signature

  2007cited by this paper
• Short Linkable Ring Signatures Revisited

  2006cited by this paper
• Efficient Group Signature Schemes for Large Groups

  2006cited by this paper
• How to win the clonewars: efficient periodic n-times anonymous authentication

  2006influential reference
• Chosen-Ciphertext Security from Tag-Based Encryption

  2006cited by this paper
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures

  2006cited by this paper
• Compact Group Signatures Without Random Oracles

  2006cited by this paper
• k-Times Anonymous Authentication with a Constant Proving Cost

  2006cited by this paper
• Unclonable Group Identification

  2006cited by this paper
• Group Signatures with Efficient Concurrent Join

  2005cited by this paper
• Compact E-Cash

  2005cited by this paper
• A Verifiable Random Function with Short Proofs and Keys

  2005cited by this paper
• Dynamic k-Times Anonymous Authentication

  2005cited by this paper
• Practical Group Signatures without Random Oracles

  2005cited by this paper
• Foundations of Group Signatures: The Case of Dynamic Groups

  2005influential reference
• Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme

  2004cited by this paper
• Separable Linkable Threshold Ring Signatures

  2004cited by this paper
• Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups (Extended Abstract)

  2004cited by this paper
• k-Times Anonymous Authentication (Extended Abstract)

  2004influential reference
• Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles

  2004cited by this paper
• Short Group Signatures

  2004cited by this paper
• Short Signatures Without Random Oracles

  2004cited by this paper
• Signature Schemes and Anonymous Credentials from Bilinear Maps

  2004cited by this paper
• Traceable Signatures

  2004cited by this paper
• Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions

  2003cited by this paper
• Efficient Construction of (Distributed) Verifiable Random Functions

  2003cited by this paper
• Unique Signatures and Verifiable Random Functions from the DH-DDH Separation

  2002cited by this paper
• Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number

  2002cited by this paper
• A Signature Scheme with Efficient Protocols

  2002cited by this paper
• An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation

  2001cited by this paper
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

  1999cited by this paper
• Verifiable random functions

  1999cited by this paper
• Efficient Group Signature Schemes for Large Groups (Extended Abstract)

  1997cited by this paper
• On-line/off-line digital signatures

  1996cited by this paper
• Group Signatures

  1991cited by this paper
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

  1988cited by this paper
• Non-interactive zero-knowledge and its applications

  1988cited by this paper
• Non-Interactive Zero-Knowledge Proof Systems

  1987cited by this paper
• How to construct random functions

  1986cited by this paper

• Scalable and Fine-Tuned Privacy Pass from Group Verifiable Random Functions

  2025cites this paper
• BFT in Blockchains: From Protocols to Use Cases

  2021cites this paper
• Selectively Linkable Group Signatures - Stronger Security and Preserved Verifiability

  2021cites this paper
• Fully Distributed Verifiable Random Functions and their Application to Decentralised Random Beacons

  2020cites this paper
• An Efficient Linkable Group Signature for Payer Tracing in Anonymous Cryptocurrencies

  2019cites this paper
• Secure Multi-Party Computation and Privacy

  2019cites this paper
• Anonyma: Anonymous Invitation-Only Registration in Malicious Adversarial Model

  2019cites this paper
• Location-Proof System based on Secure Multi-Party Computations

  2018cites this paper
• Road-to-Vehicle Communications With Time-Dependent Anonymity: A Lightweight Construction and Its Experimental Results

  2017influential citation
• Real Hidden Identity-Based Signatures

  2017cites this paper
• Distributed protocols for digital signatures and public key encryption

  2016cites this paper
• Short Group Signatures with Distributed Traceability

  2015cites this paper
• Anonymous and Publicly Linkable Reputation Systems

  2015cites this paper
• Anonymous and Publicly Linkable Reputation Systems ( Short Paper )

  2015cites this paper
• REGULAR-SS 5 : Short Group Signatures with Distributed Traceability

  2015cites this paper
• A Light-Weight Group Signature Scheme with Time-Token Dependent Linking

  2015cites this paper
• PROPS: A PRivacy-Preserving Location Proof System

  2014cites this paper
• Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions

  2013cites this paper
• Unique Ring Signatures: A Practical Construction

  2013cites this paper
• A Framework for Unique Ring Signatures

  2012influential citation
• Modelling and Verification of Group Signatures Properties

  2012cites this paper