Better security-efficiency trade-offs in permutation-based two-party computation
From MaRDI portal
Publication:6157519
DOI10.1007/978-3-030-92075-3_10OpenAlexW3215147049MaRDI QIDQ6157519
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92075-3_10
Related Items (3)
A modular approach to the security analysis of two-permutation constructions ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Correlated pseudorandomness from expand-accumulate codes
Cites Work
- Unnamed Item
- Tweakable block ciphers
- A construction of a cipher from a single pseudorandom permutation.
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Algebraic XOR-RKA-secure pseudorandom functions from post-zeroizing multilinear maps
- Fast garbling of circuits under standard assumptions
- Optimally Secure Block Ciphers from Ideal Primitives
- On the Security of the “Free-XOR” Technique
- The Related-Key Security of Iterated Even–Mansour Ciphers
- On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
- Two Halves Make a Whole
- Actively Secure OT Extension with Optimal Overhead
- Constructive Proofs of Concentration Bounds
- The “Coefficients H” Technique
- Foundations of Cryptography
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Advances in Cryptology - EUROCRYPT 2004
- Tight Security Bounds for Key-Alternating Ciphers
- Advances in Cryptology - CRYPTO 2003
This page was built for publication: Better security-efficiency trade-offs in permutation-based two-party computation
