Storing and Retrieving Secrets on a Blockchain
From MaRDI portal
Publication:5087260
DOI10.1007/978-3-030-97121-2_10zbMath1492.94189MaRDI QIDQ5087260
Elisaweta Masserova, Yifan Song, Bryan Parno, Vipul Goyal, Abhiram Kothapalli
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_10
Related Items
Storing and Retrieving Secrets on a Blockchain, PAPR: publicly auditable privacy revocation for anonymous credentials, Le Mans: dynamic and fluid MPC for dishonest majority, Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees, Individual cryptography, Forward-secure public key encryption without key update from proof-of-stake blockchain, Perfect MPC over layered graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Overcoming cryptographic impossibility results using blockchains
- How to build time-lock encryption
- Proactive secure multiparty computation with a dishonest majority
- Can a public blockchain keep a secret?
- Traceable secret sharing and applications
- Blockchains enable non-interactive MPC
- Communication-Optimal Proactive Secret Sharing for Dynamic Groups
- How to Run Turing Machines on Encrypted Data
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- On the Non-malleability of the Fiat-Shamir Transform
- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
- How to withstand mobile virus attacks, revisited
- Majority Is Not Enough: Bitcoin Mining Is Vulnerable
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
- How to share a secret
- Constant-Size Commitments to Polynomials and Their Applications
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- Founding Cryptography on Tamper-Proof Hardware Tokens
- One-Time Programs with Limited Memory
- One-Time Programs
- Scalable and Unconditionally Secure Multiparty Computation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Storing and Retrieving Secrets on a Blockchain
- How to withstand mobile virus attacks (extended abstract)
- On the (im)possibility of obfuscating programs
- Witness encryption and its applications
