(Public) verifiability for composable protocols without adaptivity or zero-knowledge
From MaRDI portal
Publication:6173120
DOI10.1007/978-3-031-20917-8_17zbMath1518.94043OpenAlexW3205065010MaRDI QIDQ6173120
Bernardo David, Carsten Baum, Rafael Dowsley
Publication date: 21 July 2023
Published in: Provable and Practical Security (Search for Journal in Brave)
Full work available at URL: https://pure.itu.dk/ws/files/93430213/2020_207.pdf
Related Items (1)
Cites Work
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Secure two-party computation via cut-and-choose oblivious transfer
- Blazing fast OT for three-round UC OT extension
- Efficient constant-round MPC with identifiable abort and public verifiability
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- Adaptive security of practical garbling schemes
- Insured MPC: efficient secure computation with financial penalties
- Algorand: a secure and efficient distributed ledger
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens
- Secure Multi-Party Computation with Identifiable Abort
- How to Use Bitcoin to Design Fair Protocols
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Publicly Auditable Secure Multi-Party Computation
- Two Halves Make a Whole
- The Bitcoin Backbone Protocol: Analysis and Applications
- Efficient Secure Multiparty Computation with Identifiable Abort
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting
- Universally Composable Security with Global Setup
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Calling Out Cheaters: Covert Security with Public Verifiability
- Advances in Cryptology - CRYPTO 2003
- Modeling Bitcoin Contracts by Timed Automata
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger
- Theory of Cryptography
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
This page was built for publication: (Public) verifiability for composable protocols without adaptivity or zero-knowledge
