Chameleon-Hashes with Dual Long-Term Trapdoors and Their Applications

@inproceedings{Krenn2018ChameleonHashesWD,
  title={Chameleon-Hashes with Dual Long-Term Trapdoors and Their Applications},
  author={Stephan Krenn and Henrich Christopher P{\"o}hls and Kai Samelin and Daniel Slamanig},
  booktitle={AFRICACRYPT},
  year={2018}
}
A chameleon-hash behaves likes a standard collision-resistant hash function for outsiders. If, however, a trapdoor is known, arbitrary collisions can be found. Chameleon-hashes with ephemeral trapdoors (\(\mathsf {CHET}\); Camenisch et al., PKC 17) allow prohibiting that the holder of the long-term trapdoor can find collisions by introducing a second, ephemeral, trapdoor. However, this ephemeral trapdoor is required to be chosen freshly for each hash. 
View via Publisher
eprint.iacr.org
14 Citations
Background Citations
5
Methods Citations
1

14 Citations

Citation Type

Citation Type

Fully Collision-Resistant Chameleon-Hashes from Simpler and Post-quantum Assumptions
TLDR
The results relax the requirement to not being dependent on public-key encryption and give rise to candidates of chameleon-hashes with strong collision-resistance guarantees and long-term security guarantees.
Efficient chameleon hash functions in the enhanced collision resistant model
Fully Invisible Protean Signatures Schemes
TLDR
The authors introduce the new notions of invisible RSs and invisible non-accountable SSs, along with a consolidated framework for aggregate signatures, and extend PSs to be fully invisible, guaranteeing that an outsider can identify neither editable nor redactable parts.
Policy-Based Sanitizable Signatures
TLDR
This work proposes a different and more powerful approach: Instead of using sanitizers’ public keys directly, they assign attributes to them, then based on policies, a sanitizer can sanitize, if, and only if, it holds a secret key to attributes satisfying the policy associated to a signature.
Fine-Grained and Controlled Rewriting in Blockchains: Chameleon-Hashing Gone Attribute-Based
TLDR
PCHs generalize the notion of chameleon-hashes by giving the party computing a hash the ability to associate access policies to the generated hashes, and apply this concept to transaction-level rewriting within blockchains, and thus support fine-grained and controlled modifiability of blockchain objects.
RSA and redactable blockchains
TLDR
This paper offers a simple method of constructing redactable blockchains inspired by the ideas underlying the well-known RSA encryption scheme and can be used in conjunction with any reasonable hash function that is used to build a blockchain.
HUCDO: A Hybrid User-centric Data Outsourcing Scheme
TLDR
This work proposes the first hybrid user-centric data outsourcing (HUCDO) scheme, which allows users to outsource data securely, efficiently, and economically via different CPSs, and are secure, efficient, and economic for users to implement while outsourcing their data via CPSs.
HUCDO
TLDR
This work proposes the first hybrid user-centric data outsourcing (HUCDO) scheme, which allows users to outsource data securely, efficiently, and economically via different CPSs, and are secure, efficient, and economic for users to implement while outsourcing their data via CPSs.
Redactable Blockchain Supporting Supervision and Self-Management
TLDR
This work revisits the conflict between the immutability and redaction of blockchain, and puts forward a new fine-grained redactable blockchain with a semi-trusted regulator, who follows the protocol but has a tendency to abuse his power.
Scalable and redactable blockchain with update and anonymity
...
...

References

SHOWING 1-10 OF 58 REFERENCES
Chameleon-Hashes with Ephemeral Trapdoors And Applications to Invisible Sanitizable Signatures
TLDR
This paper introduces the notion of chameleon-hash functions with ephemeral trapdoors, a formal security model for this new primitive as well as provably secure instantiations, and provides three direct constructions based on standard assumptions.
ID-Based Chameleon Hashes from Bilinear Pairings
TLDR
This paper proposes two new ID-based Chameleon hashing schemes from bilinear pairings and analyzes their security and efficiency.
Identity-Based Chameleon Hash and Applications
TLDR
This paper uses the identity-based chameleon hashing scheme to build the id-basedchameleon signature and a novel sealed-bid auction scheme that is robust, communication efficient (bidders send a single message), and secure under a particular trust model.
Identity-Based Chameleon Hash Scheme without Key Exposure
TLDR
This paper proposes the first identity-based chameleon hash scheme without key exposure based on the three-trapdoor mechanism, which provides an affirmative answer to the open problem.
Chameleon Hashing Without Key Exposure
TLDR
Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message, i.e., the designated recipient is capable of verifying the validity of the signature, but cannot disclose the contents of the signed information to convince any third party without the signer’s consent.
Comments and Improvements on Key-Exposure Free Chameleon Hashing Based on Factoring
TLDR
An improved chameleon hash scheme without key exposure based on factoring is proposed which enjoys all the desired security notions of chamleon hashing.
A Characterization of Chameleon Hash Functions and New, Efficient Designs
TLDR
It is shown that chameleon hash functions and Sigma protocols are equivalent, and a transform of any suitable Sigma protocol to a chamleon hash function is provided, which enables to unify previous designs of chameLeon hash functions, seeing them all as emanating from a common paradigm.
On the Key Exposure Problem in Chameleon Hashes
TLDR
This work provides several constructions of exposure-free chameleon hash functions based on different cryptographic assumptions, such as the RSA and the discrete logarithm assumptions, which may potentially be realized over a large set of cryptographic groups.
Tightly-Secure Signatures from Chameleon Hash Functions
TLDR
This work shows that any Chameleon Hash function can be transformed into a (binary) tree-based signature scheme with tight security and obtains the first tightly secure signature scheme from the SIS assumption and several schemes based on Diffie-Hellman in the standard model.
Tweaking TBE/IBE to PKE Transforms with Chameleon Hash Functions
  • Rui Zhang
  • Computer Science, Mathematics
    ACNS
  • 2007
TLDR
Two transforms to acquire chosen ciphertext security from tag based techniques are presented and preserve the public verifiability of underlying primitives, and can be extended to hierarchical identity based encryption (HIBE) and threshold settings.
...
...