Tightly-Secure Signatures from Chameleon Hash Functions
- 17 March 2015
- book chapter
- Published by Springer Nature
- p. 256-279
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- A Characterization of Chameleon Hash Functions and New, Efficient DesignsJournal of Cryptology, 2013
- Short and Stateless Signatures from the RSA Assumption2009
- Efficient Non-interactive Proof Systems for Bilinear Groups2008
- Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman ProblemsJournal of Cryptology, 2007
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear GroupsJournal of Cryptology, 2007
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles2007
- Cramer-Damgård Signatures Revisited: Efficient Flat-Tree Signatures Based on FactoringLecture Notes in Computer Science, 2005
- Short Group Signatures2004
- Short Signatures Without Random Oracles2004
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988