Transparent batchable time-lock puzzles and applications to Byzantine consensus
From MaRDI portal
Publication:6070776
DOI10.1007/978-3-031-31368-4_20OpenAlexW4367663782MaRDI QIDQ6070776
Charalampos Papamanthou, Julian Loss, Sri Aravinda Krishnan Thyagarajan, Kartik Nayak, Giulio Malavolta, Shravan Srinivasan
Publication date: 24 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_20
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- How to build time-lock encryption
- Security and composition of multiparty cryptographic protocols
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Delay encryption
- On the security of time-lock puzzles and timed commitments
- Synchronous, with a chance of partition tolerance
- Homomorphic time-lock puzzles and applications
- Time-Lock Puzzles from Randomized Encodings
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Succinct Randomized Encodings and their Applications
- The Bitcoin Backbone Protocol: Analysis and Applications
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Communication Complexity of Byzantine Agreement, Revisited
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Analysis of the Blockchain Protocol in Asynchronous Networks
- FruitChains
- Zaps and Their Applications
- Secure Computation Without Authentication
- Witness encryption and its applications
- Indistinguishability obfuscation from well-founded assumptions
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
This page was built for publication: Transparent batchable time-lock puzzles and applications to Byzantine consensus
