Optimal security reductions for unique signatures: Bypassing impossibilities with a counterexample
Optimal security reductions for unique signatures (Coron, Eurocrypt 2002) and their generalization, i.e., efficiently re-randomizable signatures (Hofheinz et al. PKC 2012 & Bader et al. Eurocrypt 2016) have been well studied in the literature. Particularly, it has been shown that under a non-int...
Saved in:
Main Authors: | FUO, Fuchun, CHEN, Rongmao, SUSILO, Willy, LAI, Jianchang, YANG, Guomin, MU, Yi |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7369 https://ink.library.smu.edu.sg/context/sis_research/article/8372/viewcontent/Optimal_security_reductions_for_unique_signatures.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A tightly secure ID-based signature scheme under DL assumption in AGM
by: LOH, Jia-Chng, et al.
Published: (2023) -
One-shot learners using negative counterexamples and nearest positive examples
by: Jain, S., et al.
Published: (2013) -
REALISM ABOUT IMPOSSIBLE FICTIONS
by: EUGENE HO WEI KANG
Published: (2023) -
Learning languages from positive data and a limited number of short counterexamples
by: Jain, S., et al.
Published: (2013) -
Learning languages from positive data and negative counterexamples
by: Jain, S., et al.
Published: (2013)