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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We study leakage-resilient continuously non-malleable secret sharing, as recently introduced by Faonio and Venturi (CRYPTO 2019… 
2012
2012
Blind signatures provide a mechanism for achieving privacy and anonymity whereby a user gets the signer to sign a message of his… 
Highly Cited
2012
Highly Cited
2012
Noninteractive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptographic constructions, including… 
Highly Cited
2010
Highly Cited
2010
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero… 
2009
2009
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an… 
Highly Cited
2006
Highly Cited
2006
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity… 
Highly Cited
2006
Highly Cited
2006
We provide the first construction of a concurrent and non-malleable zero knowledge argument for every language in NP. We stress… 
Highly Cited
2005
Highly Cited
2005
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions… 
Highly Cited
2003
Highly Cited
2003
  • R. Pass
  • CRYPTO
  • 2003
  • Corpus ID: 1605569
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We… 
Highly Cited
2003
Highly Cited
2003
Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount…