Common reference string model
Semantic Scholar uses AI to extract papers important to this topic.
Blind signatures provide a mechanism for achieving privacy and anonymity whereby a user gets the signer to sign a message of his… Expand Noninteractive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptographic constructions, including… Expand We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero… Expand Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model lose… Expand Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an… Expand We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity… Expand We provide the first construction of a concurrent and non-malleable zero knowledge argument for every language in NP. We stress… Expand Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions… Expand We propose a modification to the framework of Universally Composable (UC) security . Our new notion involves comparing the… Expand We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We… Expand