Efficient electronic cash using batch signatures

DOI10.1007/3-540-48970-3_20MaRDI QIDQ4250643zbMATH OpenFDO

Authors Ernest Foo, Chris Pavlovski, Colin A. Boyd

Publication date 17 June 1999

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

Full work available at URL https://doi.org/10.1007/3-540-48970-3_20

zbMATH Keywords

cryptographyelectronic cash payment protocol

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2044552
• scientific article; zbMATH DE number 2080720
• Efficient electronic money. (Extended abstract)
• Provably Secure Electronic Cash Based on Blind Multisignature Schemes
• An efficient divisible electronic cash scheme
• Efficient self-certified signatures with batch verification
• Identity-based partially blind signature in the standard model for electronic cash
• Efficient fair exchange with verifiable confirmation of signatures
• A Universally Composable Scheme for Electronic Cash
• Efficient signature generation by smart cards

Cited in

(3)

• scientific article; zbMATH DE number 1700045 (Why is no real title available?)
• scientific article; zbMATH DE number 1759332 (Why is no real title available?)
• Information Security

This page was built for publication: Efficient electronic cash using batch signatures

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