swMATH9866MaRDI QIDQ21845FDOQ21845
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007%2F978-3-642-38348-9_32
Cited In (24)
- Scalable multi-party private set-intersection
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
- Reactive garbling: foundation, instantiation, application
- On the complexity of additively homomorphic UC commitments
- Rate-1, linear time and additively homomorphic UC commitments
- Faster secure two-party computation in the single-execution setting
- Non-interactive secure 2PC in the offline/online and batch settings
- MiniLEGO: efficient secure two-party computation from general assumptions
- High-performance multi-party computation for binary circuits based on oblivious transfer
- VIFF
- TASTY
- VMCrypt
- FleXOR
- JustGarble
- gmpy2
- EMP-toolkit
- GraphSC
- JIMU
- TinyLEGO
- ZIDS
- Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
- Cross and clean: amortized garbled circuits with constant overhead
- JIMU: faster LEGO-based secure computation using additive homomorphic hashes
This page was built for software: MiniLEGO
