Oblivious transfer with constant computational overhead
From MaRDI portal
Publication:6138086
Recommendations
- Cryptography with constant computational overhead
- More efficient oblivious transfer extensions
- Founding Cryptography on Oblivious Transfer – Efficiently
- Actively secure garbled circuits with constant communication overhead in the plain model
- Actively secure garbled circuits with constant communication overhead in the plain model
Cites work
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1263215 (Why is no real title available?)
- A dichotomy for local small-bias generators
- Actively secure OT extension with optimal overhead
- Advances in Cryptology - CRYPTO 2003
- Algebraic attacks against random local functions and their countermeasures
- Asymptotically quasi-optimal cryptography
- Binary AMD circuits from secure multiparty computation
- Candidate one-way functions based on expander graphs
- Circuits resilient to additive attacks with applications to secure computation
- Constrained pseudorandom functions and their applications
- Correlated pseudorandomness from expand-accumulate codes
- Cryptographic hardness of random local functions -- survey
- Cryptographic hardness of random local functions. Survey
- Cryptography in $NC^0$
- Cryptography with constant computational overhead
- Distributed Point Functions and Their Applications
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Extracting correlations
- Faster sounder succinct arguments and \textsf{IOP}s
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Function secret sharing
- Functional signatures and pseudorandom functions
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Locally computable UOWHF with linear shrinkage
- Low-complexity cryptographic hash functions
- More efficient oblivious transfer extensions
- New Algorithms for Learning in Presence of Errors
- On linear-size pseudorandom generators and hardcore functions
- On perfectly secure 2PC in the OT-hybrid model
- On the Security of Goldreich’s One-Way Function
- On the concrete security of Goldreich's pseudorandom generator
- On the one-way function candidate proposed by Goldreich
- On the power of correlated randomness in secure computation
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Progress in Cryptology – Mycrypt 2005
- Proving as fast as computing: succinct arguments with constant prover overhead
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Secure arithmetic computation with constant computational overhead
- Secure non-interactive reduction and spectral analysis of correlations
- Secure non-interactive simulation: feasibility and rate
- Security and composition of multiparty cryptographic protocols
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
- TinyKeys: a new approach to efficient multi-party computation
- XOR codes and sparse learning parity with noise
This page was built for publication: Oblivious transfer with constant computational overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138086)
