scientific article; zbMATH DE number 2009981

zbMath1038.94539MaRDI QIDQ4434900

No author found.

Publication date: 26 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560578.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (18)

Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Maliciously-secure MrNISC in the plain model ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ Utility dependence in correct and fair rational secret sharing ⋮ Blockchains enable non-interactive MPC ⋮ Multi-party computation with conversion of secret sharing ⋮ An Algebraic Approach to Nonmalleability ⋮ Round-optimal secure multi-party computation ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Post-quantum multi-party computation ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function

This page was built for publication: