Partitioned encryption and achieving simultaneity by partitioning
From MaRDI portal
Publication:1099131
DOI10.1016/0020-0190(87)90042-1zbMath0637.94015OpenAlexW1969234155MaRDI QIDQ1099131
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90042-1
cryptographycryptographic protocolfault-tolerant distributed computingpartitioned encryptionprobabilistic public-key encryptionsimultaneous broadcastverifiable secret- sharingzero-knowledge interactive proof-system
Related Items (3)
Computing in social networks ⋮ Decentralized polling with respectable participants ⋮ Efficient and Decentralized Polling Protocol for General Social Networks
Cites Work
- Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and The Multi-Player Mental Poker Game (extended abstract)
- How to share a secret
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- A method for obtaining digital signatures and public-key cryptosystems
- The knowledge complexity of interactive proof-systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Partitioned encryption and achieving simultaneity by partitioning