Skip to search formSkip to main contentSkip to account menu

Common reference string model

Known as: CRS, Common reference sting model, Common reference string 
In cryptography, the common reference string (CRS) model captures the assumption that a trusted setup in which all involved parties get access to the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Non-interactive zero-knowledge proofProvable securityUniversal composability

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Leakage-Resilient Key Exchange and Two-Seed Extractors
Can Alice and Bob agree on a uniformly random secret key without having any truly secret randomness to begin with? Here we… 
2020
2020
Building Group Key Establishment on Group Theory: A Modular Approach
A group key establishment protocol is presented and proven secure in the common reference string mode. The protocol builds on a… 
2019
2019
QAP-based Simulation-Extractable SNARK with a Single Verification
. The pairing-based simulation-extractable succinct non-interactive arguments of knowledge (SE-SNARKs) are attractive since they… 
2012
2012
An Efficient Non-interactive Universally Composable String-Commitment Scheme
This paper presents a new non-interactive string-commitment scheme that achieves universally composable security. Security is… 
2012
2012
A Framework for Efficient Fully-Equipped UC Commitments
We present a general framework for constructing non-interactive universally composable (UC) commitment schemes that are secure… 
2010
2010
Efficient Implementation of the Orlandi Protocol Extended Version
We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty… 
2010
2010
Black-Box Computational Zero-Knowledge Proofs, Revisited: The Simulation-Extraction Paradigm
The concept of zero-knowledge proofs has been around for about 25 years. It has been redefined over and over to suit the special… 
2009
2009
Efficient Non-interactive Universally Composable String-Commitment Schemes
The universal composability (UC) for commitment is a very strong security notion. It guarantees that commitment schemes remain… 
2005
2005
Universally Composable Time-Stamping Schemes with Audit
We present a Universally Composable (UC) time-stamping scheme based on universal one-way hash functions. The model we use… 
2004
2004
General Composability without a Common Reference String
We propose a modification to the frame-work of Universally Composable (UC) security [3]. Our new notion, involves comparing the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)