How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JustGarble / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FleXOR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniLEGO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_32 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2554094111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Output Secure Computation with Malicious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast garbling of circuits under standard assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortizing Garbled Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Private Function Evaluation with Linear Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Garbling Scheme for Formulas with Constant Size of Garbled Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Garbled Circuit: Free XOR Gates and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Universal Circuit Construction and Secure Evaluation of Private Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings / rank
 
Normal rank
Property / cites work
 
Property / cites work: LEGO for Two-Party Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation Is Practical / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal circuits (Preliminary Report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Halves Make a Whole / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:03, 13 July 2024

scientific article
Language Label Description Also known as
English
How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
scientific article

    Statements

    How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (English)
    0 references
    0 references
    0 references
    0 references
    6 January 2017
    0 references
    garbled circuits
    0 references
    lower bound on linear garbling schemes
    0 references
    semi-private function evaluation
    0 references
    0 references
    0 references
    0 references

    Identifiers