Public Key Cryptography - PKC 2006

DOI10.1007/11745853zbMath1151.94551OpenAlexW4205680410MaRDI QIDQ5898961

Matthew Franklin, Payman Mohassel

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11745853

zbMATH Keywords

malicious adversarysecure function evaluationsecure two-party computationYao's garbled circuit

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Rate-limited secure function evaluation ⋮ Enforcing input correctness via certification in garbled circuit evaluation ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Authenticated garbling from simple correlations ⋮ Secure computation with low communication from cross-checking ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ On the exact round complexity of secure three-party computation ⋮ An Efficient Protocol for Fair Secure Two-Party Computation ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge ⋮ Multiparty generation of an RSA modulus ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings