Cryptography in the multi-string model
type: Item
instance of: scholarly article
title: Cryptography in the multi-string model
zbMATH Open document ID: 1302.94050
author: Jens Groth
author: Rafail Ostrovsky
published in: Journal of Cryptology
publication date: 2014-09-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 6347560
zbMATH Keywords: common random string model
zbMATH Keywords: multi-string model
zbMATH Keywords: non-interactive zero-knowledge
zbMATH Keywords: universally composable commitment
zbMATH Keywords: multi-party computation
MaRDI profile type: Publication
full work available at URL: s00145-013-9152-y
OpenAlex ID: W2025143408
cites work: Theory of Cryptography
cites work: Derandomization in Cryptography
cites work: Q4527012
cites work: Noninteractive Zero-Knowledge
cites work: Identity-Based Encryption from the Weil Pairing
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Q4783717
cites work: Q4228521
cites work: Universally composable two-party and multi-party secure computation
cites work: Universally Composable Security with Global Setup
cites work: Q4249317
cites work: Q4279688
cites work: Q4536817
cites work: Q4409144
cites work: Q4230367
cites work: Q4938630
cites work: Q4783745
cites work: Q4440437
cites work: Q4542531
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Strengthening zero-knowledge protocols using signatures
cites work: Bringing People of Different Beliefs Together to Do UC
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Q3729902
cites work: Secure multi-party computation without agreement
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Universally Composable Multi-party Computation with an Unreliable Common Reference String
cites work: On the Least Prime in Certain Arithmetic Progressions
cites work: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
cites work: Cryptography in the Multi-string Model
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: A Pseudorandom Generator from any One-way Function
cites work: An efficient noninteractive zero-knowledge proof system for NP with general assumptions
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Bit commitment using pseudorandomness
cites work: Synthesizers and their application to the parallel construction of pseudo-random functions
DOI: 10.1007/S00145-013-9152-Y
description: scientific article; zbMATH DE number 6347560