Book ChapterDOI
Sanitizable Signatures with Strong Transparency in the Standard Model
Shivank Agrawal,Swarun Kumar,Amjed Shareef,C. Pandu Rangan +3 more
- pp 93-107
Reads0
Chats0
TLDR
In this paper, the authors described the first efficient and provably secure sanitizable signature scheme having strong transparency under the standard model, where the verifier cannot identify whether the message has been sanitized.Abstract:
Sanitizable signatures provide several security features which are useful in many scenarios including military and medical applications. Sanitizable signatures allow a semi-trusted party to update some part of the digitally signed document without interacting with the original signer. Such schemes, where the verifier cannot identify whether the message has been sanitized, are said to possess strong transparency. In this paper, we have described the first efficient and provably secure sanitizable signature scheme having strong transparency under the standard model.read more
Citations
More filters
Book ChapterDOI
Fully-secure and practical sanitizable signatures
TL;DR: A stronger security model based on Brzuska et al.'s model and a fullysecure construction based on both BrzUSka etAl.'s and Canard et al.'s constructions are presented, much more practical than prior ones.
Patent
Method and system for modifying an authenticated and/or encrypted message
TL;DR: In this paper, a method for modifying an authenticated and/or encrypted message by a modifying party exchanged between a sending party and a receiving party based on a secure communication protocol is described.
Proceedings Article
Sanitizable sgnatures with srong tansparency in the sandard model
TL;DR: This paper has described the first efficient and provably secure sanitizable signature scheme having strong transparency under the standard model.
Book ChapterDOI
FABSS: Attribute-Based Sanitizable Signature for Flexible Access Structure
TL;DR: This paper obfuscates users identity information with attribute sets and introduces a semi-trusted participant–sanitizer to propose the Flexible Attribute-Based Sanitizable Signature (FABSS) scheme, and proves that the scheme is unforgeable under generic group model.
References
More filters
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Book ChapterDOI
Efficient identity-based encryption without random oracles
TL;DR: This work first presents their IBE construction and reduces the security of the scheme to the decisional Bilinear Diffie-Hellman (BDH) problem, and shows that their techniques can be used to build a new signature scheme that is secure under the computational Diffie -Hellman assumption without random oracles.
Book ChapterDOI
Short Signatures Without Random Oracles
Dan Boneh,Xavier Boyen +1 more
TL;DR: The Strong Diffie-Hellman assumption has been used in this article to construct a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles.
Book ChapterDOI
Efficient non-interactive proof systems for bilinear groups
Jens Groth,Amit Sahai +1 more
TL;DR: In this article, a general methodology for constructing very simple and efficient non-interactive zero-knowledge proofs and noninteractive witness-indistinguishable proofs that work directly for groups with a bilinear map, without needing a reduction to Circuit Satisfiability is presented.
Book ChapterDOI
Practical identity-based encryption without random oracles
TL;DR: In this paper, Boneh et al. presented an identity-based encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems, namely, computational efficiency, shorter public parameters, and a tight security reduction, albeit to a stronger assumption that depends on the number of private key generation queries made by the adversary.