Cryptography in the Multi-string Model

DOI10.1007/978-3-540-74143-5_18zbMath1215.94048OpenAlexW2163257790MaRDI QIDQ3612557

Rafail Ostrovsky, Jens Groth

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_18

zbMATH Keywords

non-interactive zero-knowledgemulti-party computationcommon random string modelmulti-string modeluniversally composable commitment

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (15)

Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Generic attacks on hash combiners ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Secure MPC: laziness leads to GOD ⋮ On communication models and best-achievable security in two-round MPC ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware ⋮ Cryptography in the multi-string model ⋮ Towards accountability in CRS generation

This page was built for publication: Cryptography in the Multi-string Model