Storing and retrieving secrets on a blockchain

DOI10.1007/978-3-030-97121-2_10MaRDI QIDQ5087260zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Abhiram Kothapalli, Elisaweta Masserova, Bryan Parno, Yifan Song

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

zbMATH Keywords

secret sharing schemedynamic proactive secret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Can a public blockchain keep a secret?
• Fair hierarchical secret sharing scheme based on smart contract
• Proactive Secret Sharing with a Dishonest Majority
• Fully dynamic secret sharing schemes
• scientific article; zbMATH DE number 1031003

Cites work

• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1031003 (Why is no real title available?)
• Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Blockchains enable non-interactive MPC
• Can a public blockchain keep a secret?
• Communication-optimal proactive secret sharing for dynamic groups
• Constant-Size Commitments to Polynomials and Their Applications
• Encoding functions with constant online rate, or how to compress garbled circuit keys
• Founding Cryptography on Tamper-Proof Hardware Tokens
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to build time-lock encryption
• How to run Turing machines on encrypted data
• How to share a secret
• How to withstand mobile virus attacks (extended abstract)
• How to withstand mobile virus attacks, revisited
• Majority is not enough: bitcoin mining is vulnerable
• On the (im)possibility of obfuscating programs
• On the Non-malleability of the Fiat-Shamir Transform
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• One-Time Programs
• One-time programs with limited memory
• Overcoming cryptographic impossibility results using blockchains
• Proactive secure multiparty computation with a dishonest majority
• Scalable and Unconditionally Secure Multiparty Computation
• Storing and retrieving secrets on a blockchain
• Traceable secret sharing and applications
• Witness encryption and its applications

Cited in

(9)

• Universally composable auditable surveillance
• Individual cryptography
• Forward-secure public key encryption without key update from proof-of-stake blockchain
• Le Mans: dynamic and fluid MPC for dishonest majority
• Perfect MPC over layered graphs
• Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
• PAPR: publicly auditable privacy revocation for anonymous credentials
• Storing and retrieving secrets on a blockchain
• Can a public blockchain keep a secret?

Describes a project that uses

Uses Software

• gRPC
• GitHub
• Barreto-Naehrig

This page was built for publication: Storing and retrieving secrets on a blockchain

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