Oblivious transfer with constant computational overhead (Q6138086): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Secure non-interactive reduction and spectral analysis of correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfectly secure 2PC in the OT-hybrid model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators with long stretch and low locality from random local one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Hardness of Random Local Functions–Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness of random local functions. Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy for local small-bias generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure arithmetic computation with constant computational overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4638056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in $NC^0$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic attacks against random local functions and their countermeasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Computable UOWHF with Linear Shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Learning in Presence of Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient oblivious transfer extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Cryptology – Mycrypt 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear-size pseudorandom generators and hardcore functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Security of Goldreich’s One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: XOR Codes and Sparse Learning Parity with Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal SNARGs via linear multi-prover interactive proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Pseudorandom Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlated pseudorandomness from expand-accumulate codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pseudorandom correlation generators: silent OT extension and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pseudorandom correlation generators from ring-LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Signatures and Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically quasi-optimal cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the One-Way Function Candidate Proposed by Goldreich / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concrete security of Goldreich's pseudorandom generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits resilient to additive attacks with applications to secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary AMD Circuits from Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Point Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: TinyKeys: a new approach to efficient multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Correlated Randomness in Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster sounder succinct arguments and \textsf{IOP}s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Actively Secure OT Extension with Optimal Overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure non-interactive simulation: feasibility and rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving as fast as computing: succinct arguments with constant prover overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234087 / rank
 
Normal rank

Latest revision as of 10:31, 23 August 2024

scientific article; zbMATH DE number 7789163
Language Label Description Also known as
English
Oblivious transfer with constant computational overhead
scientific article; zbMATH DE number 7789163

    Statements

    Oblivious transfer with constant computational overhead (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2024
    0 references
    secure two-party computation of Boolean circuits
    0 references
    constant-overhead pseudorandom correlation generator
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers