A signature scheme with efficient proof of validity

DOI10.1007/978-3-642-20901-7_1MaRDI QIDQ3005577zbMATH OpenOpenAlexFDO

Authors Masayuki Abe, Miyako Ohkubo

Publication date 8 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20901-7_1

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1952906
• scientific article; zbMATH DE number 2058683
• Efficient Structure-Preserving Signature Scheme from Standard Assumptions
• Compact Group Signatures Without Random Oracles
• Information Security and Privacy

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient signature generation by smart cards
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fully Anonymous Group Signatures Without Random Oracles
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• Pairings for cryptographers
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Security arguments for digital signatures and blind signatures
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Structure-preserving signatures and commitments to group elements
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• The exact security of digital signatures -- how to sign with RSA and Rabin

Cited in

(3)

• An efficient one-move nominative signature scheme
• scientific article; zbMATH DE number 1618064 (Why is no real title available?)
• Signatures and efficient proofs on committed graphs and NP-statements

This page was built for publication: A signature scheme with efficient proof of validity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005577)