Laconic function evaluation for Turing machines (Q6067382): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Delegating RAM Computations with Adaptive Soundness and Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability obfuscation for Turing machines: constant overhead and amortization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output compression, MPC, and iO for Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Randomized Encodings and their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of Extractability Assumptions with Distributional Auxiliary Input / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Negative Results on Differing-Inputs Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography for Parallel RAM from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laconic oblivious transfer and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Succinct Garbled RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Witness encryption and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Run Turing Machines on Encrypted Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the Sub-Exponential Barrier in Obfustopia / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple construction of iO for Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Communication Complexity of Secure Function Evaluation with Long Output / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability Obfuscation for Turing Machines with Unbounded Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring constructions of compact NIZKs from various assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-input laconic function evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate obfuscation via oblivious LWE sampling / rank
 
Normal rank

Latest revision as of 10:55, 19 August 2024

scientific article; zbMATH DE number 7766995
Language Label Description Also known as
English
Laconic function evaluation for Turing machines
scientific article; zbMATH DE number 7766995

    Statements

    Laconic function evaluation for Turing machines (English)
    0 references
    0 references
    0 references
    0 references
    16 November 2023
    0 references
    0 references
    0 references
    0 references