Transaction protection by beacons

DOI10.1016/0022-0000(83)90042-9MaRDI QIDQ1065755zbMATH OpenOpenAlexFDO

Authors Michael O. Rabin

Publication date 1983

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(83)90042-9

zbMATH Keywords

certified mailconfidential disclosurescontract signingcryptographyelectronic mail systemprivacy protectionprotection of business transactions

Mathematics Subject Classification ID

Communication, information (94A99)

Recommendations

• Beacon based authentication
• Blind Signature System
• scientific article; zbMATH DE number 3856987
• scientific article; zbMATH DE number 2080692
• Improved Multi-party Contract Signing

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• New directions in cryptography

Cited in

(27)

• Continuous verifiable delay functions
• On the (im)possibility of non-interactive correlation distillation
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• PoW-based distributed cryptography with no trusted setup
• Asymptotics of quantum contract signing
• Necessity of parameter randomization in quantum contract signing
• Reducibility among protocols. (Extended abstract)
• Efficient verifiable delay functions
• Short-lived zero-knowledge proofs and signatures
• On time-lock cryptographic assumptions in abelian hidden-order groups
• Time-release cryptography from minimal circuit assumptions
• Building blocks of sharding blockchain systems: concepts, approaches, and open problems
• Lifting standard model reductions to common setup assumptions
• SCRAPE: scalable randomness attested by public entities
• Fiat-Shamir security of FRI and related SNARKs
• (Verifiable) delay functions from Lucas sequences
• Malleability of the blockchain's entropy
• (Im)possibility of symmetric encryption against coordinated algorithm substitution attacks and key exfiltration
• Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
• Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
• Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
• Improved YOSO randomness generation with worst-case corruptions
• Shared versus private randomness in distributed interactive proofs
• Channel simulation: theory and applications to lossy compression and differential privacy
• Faster proofs and VRFs from isogenies
• Beacon based authentication
• Portable security transaction protocol

This page was built for publication: Transaction protection by beacons

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