Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys

DOI10.1007/978-3-662-49384-7_12zbMath1388.94054OpenAlexW2296153936MaRDI QIDQ2798781

Giulio Malavolta, Johannes Krupp, Nils Fleischhacker, Dominique Schröder, Jonas Schneider, Mark Simkin

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_12

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Revocable policy-based chameleon hash ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Unlinkable policy-based sanitizable signatures ⋮ Protean Signature Schemes ⋮ Deterministic wallets for adaptor signatures ⋮ Compact Ring Signature in the Standard Model for Blockchain ⋮ Chameleon-Hashes with Ephemeral Trapdoors ⋮ Aggregatable distributed key generation ⋮ Updatable signatures and message authentication codes ⋮ Unlinkable and invisible \(\gamma \)-sanitizable signatures

Cites Work

• Learning register automata: from languages to program structures
• Inference of finite automata using homing sequences
• An interpolating theorem prover
• Viper: A Verification Infrastructure for Permission-Based Reasoning
• Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems
• PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification
• Inferring Canonical Register Automata
• Büchi Store: An Open Repository of Büchi Automata
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
• Learning the Language of Error
• Learning Minimal Separating DFA’s for Compositional Verification
• Interpolant Strength
• The size-change principle for program termination
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Computer Aided Verification
• Ultimately periodic words of rational ω-languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys