Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
From MaRDI portal
Publication:2900636
DOI10.1007/978-3-642-31410-0_24zbMATH Open1291.94169OpenAlexW1526535719MaRDI QIDQ2900636FDOQ2900636
Authors: David Xiao 
Publication date: 23 July 2012
Published in: Progress in Cryptology - AFRICACRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31410-0_24
Recommendations
- (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- Bounds on the efficiency of black-box commitment schemes
- Automata, Languages and Programming
- Round-optimal black-box two-party computation
- Round-optimal black-box commit-and-prove with succinct communication
- Round-optimal black-box secure computation from two-round malicious OT
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
Cited In (5)
- Round optimal black-box ``commit-and-prove
- (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
- Bounds on the efficiency of black-box commitment schemes
- Revisiting lower and upper bounds for selective decommitments
- Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
This page was built for publication: Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900636)
