Better concrete security for half-gates garbling (in the multi-instance setting)
type: Item
instance of: scholarly article
title: Better concrete security for half-gates garbling (in the multi-instance setting)
DOI: 10.1007/978-3-030-56880-1_28
author: Yanyan Li
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68-XX
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614588
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 28
OpenAlex ID: W2982306228
cites work: Hash-Function Based PRFs: AMAC and Its Multi-User Security
cites work: Q3374913
cites work: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
cites work: The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
cites work: Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
cites work: Tight Security Bounds for Key-Alternating Ciphers
cites work: Q4737250
cites work: Building indifferentiable compression functions from the PGV compression functions
cites work: Fast garbling of circuits under standard assumptions
cites work: Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
cites work: Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
cites work: Amortizing Garbled Circuits
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Optimal Security Proofs for Signatures from Identification Schemes
cites work: FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
cites work: Secure two-party computation via cut-and-choose oblivious transfer
cites work: Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
cites work: The “Coefficients H” Technique
cites work: Secure Two-Party Computation Is Practical
cites work: Two-Output Secure Computation with Malicious Adversaries
cites work: Optimally Secure Block Ciphers from Ideal Primitives
cites work: Two Halves Make a Whole
description: scientific article; zbMATH DE number 7614588