scholarly journals Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs

2005 ◽  
pp. 662-681 ◽  
Author(s):  
Craig Gentry ◽  
David Molnar ◽  
Zulfikar Ramzan
Keyword(s):  
Zero Knowledge ◽  
Random Oracles

A CCA2-Secure Multi-Decrypter Encryption Scheme Without Random Oracles

Informatica ◽  
2015 ◽  
Vol 26 (3) ◽  
pp. 543-556
Author(s):  
Shengbao Wang ◽  
Peng Zeng ◽  
Kim-Kwang Raymond Choo ◽  
Hongbing Wang
Keyword(s):  
Encryption Scheme ◽  
Random Oracles

Sender Authenticated Key Agreements without Random Oracles

2009 ◽  
Vol E92-A (8) ◽  
pp. 1787-1794
Author(s):  
Chifumi SATO ◽  
Takeshi OKAMOTO ◽  
Eiji OKAMOTO
Keyword(s):  
Random Oracles

New short group signature scheme without random oracles

2011 ◽  
Vol 31 (3) ◽  
pp. 790-792
Author(s):  
Yan YUAN ◽  
Guang-xing CAI
Keyword(s):  
Group Signature ◽  
Signature Scheme ◽  
Random Oracles

Fully anonymous multi-service subscription system without random oracles

2013 ◽  
Vol 33 (2) ◽  
pp. 417-422
Author(s):  
Xin LIU ◽  
Wenqing LEI
Keyword(s):  
Random Oracles

Publicly auditable conditional blind signatures

2021 ◽  
Vol 29 (2) ◽  
pp. 229-271
Author(s):  
Panagiotis Grontas ◽  
Aris Pagourtzis ◽  
Alexandros Zacharakis ◽  
Bingsheng Zhang
Keyword(s):  
Proof Of Concept ◽  
Equivalence Test ◽  
Zero Knowledge ◽  
Private Key ◽  
Blind Signatures ◽  
Cryptographic Primitive ◽  
Security Properties ◽  
Designated Verifier

This work formalizes Publicly Auditable Conditional Blind Signatures (PACBS), a new cryptographic primitive that allows the verifiable issuance of blind signatures, the validity of which is contingent upon a predicate and decided by a designated verifier. In particular, when a user requests the signing of a message, blinded to protect her privacy, the signer embeds data in the signature that makes it valid if and only if a condition holds. A verifier, identified by a private key, can check the signature and learn the value of the predicate. Auditability mechanisms in the form of non-interactive zero-knowledge proofs are provided, so that a cheating signer cannot issue arbitrary signatures and a cheating verifier cannot ignore the embedded condition. The security properties of this new primitive are defined using cryptographic games. A proof-of-concept construction, based on the Okamoto–Schnorr blind signatures infused with a plaintext equivalence test is presented and its security is analyzed.

Sign in / Sign up

Export Citation Format

Share Document