Conditionally input-revealing 2PC and fuzzy password-authenticated key exchange
From MaRDI portal
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient secure two-party computation using symmetric cut-and-choose
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Fuzzy asymmetric password-authenticated key exchange
- Fuzzy password-authenticated key exchange
- Garbled circuits checking garbled circuits: more efficient and secure two-party computation
- Generalized fuzzy password-authenticated key exchange from error correcting codes
- How to tolerate typos in strong asymmetric PAKE
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- On the round complexity of OT extension
- Optimizing authenticated garbling for faster secure two-party computation
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Public Key Cryptography - PKC 2006
- Richer Efficiency/Security Trade-offs in 2PC
- Secure Computation Without Authentication
- Secure integration of asymmetric and symmetric encryption schemes
- Secure two-party computation via cut-and-choose oblivious transfer
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- tPAKE: typo-tolerant password-authenticated key exchange
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Universally composable two-party and multi-party secure computation
This page was built for publication: Conditionally input-revealing 2PC and fuzzy password-authenticated key exchange
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299809)
