Secure and efficient off-line digital money (extended abstract)

DOI10.1007/3-540-56939-1_78zbMath1418.68081OpenAlexW1570307720MaRDI QIDQ4630266

Matthew Franklin, Mordechai M. Yung

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_78

zbMATH Keywords

blind signatureoblivious transfersmart cardnegligible probability

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Off-line electronic cash based on secret-key certificates

Cites Work

• Unnamed Item
• Probabilistic encryption
• Zero-knowledge proofs of identity
• On-line/off-line digital signatures
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• The Discrete Logarithm Hides $O(\log n)$ Bits
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• Noninteractive Zero-Knowledge
• Universal Electronic Cash
• A method for obtaining digital signatures and public-key cryptosystems
• Communication efficient Zero-knowledge Proofs of knowledge

This page was built for publication: Secure and efficient off-line digital money (extended abstract)