Cryptography in the Multi-string Model

DOI10.1007/978-3-540-74143-5_18MaRDI QIDQ3612557zbMATH OpenOpenAlexFDO

Authors Jens Groth, Rafail Ostrovsky

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

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

Recommendations

• Cryptography in the multi-string model
• scientific article; zbMATH DE number 1842484
• Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
• Efficient non-interactive universally composable string-commitment schemes
• Universally Composable Multi-party Computation with an Unreliable Common Reference String

Cited in

(22)

• Single-input functionality against a dishonest majority: practical and round-optimal
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Your reputation's safe with me: framing-free distributed 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
• Linearly homomorphic structure-preserving signatures and their applications
• Cryptography in the multi-string model
• Improved black-box constructions of composable secure computation
• Distributed (correlation) samplers: how to remove a trusted dealer in one round
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Towards accountability in CRS generation
• Witness semantic security
• Non-interactive zero-knowledge proofs to multiple verifiers
• Secure MPC: laziness leads to GOD
• Generic attacks on hash combiners
• NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness
• A survey of symbolic methods in computational analysis of cryptographic systems
• Towards accountability in CRS generation
• On communication models and best-achievable security in two-round MPC

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612557)