Hybrid Trapdoor Commitments and Their Applications

@inproceedings{Catalano2005HybridTC,
  title={Hybrid Trapdoor Commitments and Their Applications},
  author={Dario Catalano and Ivan Visconti},
  booktitle={ICALP},
  year={2005}
}
We introduce the notion of hybrid trapdoor commitment schemes. Intuitively an hybrid trapdoor commitment scheme is a primitive which can be either an unconditionally binding commitment scheme or a trapdoor commitment scheme depending on the distribution of commitment parameters. Moreover, such two distributions are computationally indistinguishable. Hybrid trapdoor commitments are related but different with respect to mixed commitments (introduced by Damgard and Nielsen at Crypto 2002). In… 
Hybrid commitments and their applications to zero-knowledge proof systems
Mercurial Commitments: Minimal Assumptions and Efficient Constructions
TLDR
This work provides simple constructions of TMCs from any trapdoor bit commitment scheme, and gives a stronger and yet much simpler definition of mercurial commitments than that of [8], which is met by constructions in the trusted parameters (TP) model.
Somewhere Statistically Binding Commitment Schemes with Applications
TLDR
A new primitive is introduced that is a generalization of dual-mode commitments but has similarities with SSB hash functions without local opening, and can be instantiated by generalizing the succinct Extended Multi-Pedersen commitment scheme.
Improved Security Notions and Protocols for Non-transferable Identification
TLDR
A new strong and achievable notion for resettable non-transferable identification is introduced that reflects real scenarios more adequately and a generic protocol is presented that satisfies this notion.
Fiat-Shamir for Highly Sound Protocols is Instantiable
TLDR
A compiler is constructed that transforms any 3-move interactive protocol with instance-independent commitments and simulators a property satisfied by the Lapidot-Shamir protocol, Crypto '90 into a compiled protocol in the CRS model that is highly sound.
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation
TLDR
At the core of the construction of mrNISC is a witness encryption scheme for a special language that verifies Non-Interactive Zero-Knowledge (NIZK) proofs of the validity of computations over committed values, which is of independent interest.
Offline OR Composition of Sigma Protocols
TLDR
This paper provides the first efficient construction of a 3-round public-coin witness-indistinguishable (k, n)-proof of partial knowledge where all instances can be decided in the third round, and enjoys adaptive-input witness indistinguishability.
Online/Offline OR Composition of Sigma Protocols
TLDR
This paper provides the first efficient construction of a 3-round public-coin witness-indistinguishable k,i¾?n-proof of partial knowledge where all instances can be decided in the third round and enjoys adaptive-input witness indistinguishability.
On constant-round concurrent non-malleable proof systems
...
...

References

SHOWING 1-10 OF 36 REFERENCES
Mercurial Commitments: Minimal Assumptions and Efficient Constructions
TLDR
This work provides simple constructions of TMCs from any trapdoor bit commitment scheme, and gives a stronger and yet much simpler definition of mercurial commitments than that of [8], which is met by constructions in the trusted parameters (TP) model.
Non-interactive and reusable non-malleable commitment schemes
TLDR
It is shown how to construct non-interactive NM commitments that remain non-malleable even if the adversary has access to an arbitrary number of commitments from honest players - rather than one, as in several previous schemes.
Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks
TLDR
The notion of multi-trapdoor commitments is introduced which is a stronger form of trapdoor commitment schemes and the construction of a compiler is constructed that takes any proof of knowledge and transforms it into one which is secure against a concurrent man-in-the-middle attack.
On Simulation-Sound Trapdoor Commitments
TLDR
A new, simpler definition for an SSTC scheme is presented that admits more efficient constructions and can be used in a larger set of applications, and how to construct S STC schemes from any one-way functions and based on specific number-theoretic assumptions is shown.
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
TLDR
These are the first schemes to show that constant expansion factor, perfect hiding, and perfect binding can be obtained for universally composable commitments.
Paillier's cryptosystem revisited
We re-examine Paillier's cryptosystem, and show that by choosing a particular discrete log base g, and by introducing an alternative decryption procedure, we can extend the scheme to allow an
A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications
TLDR
This paper shows how to construct a perfectly hiding commitment schemes that allows for an on-line / off-line efficiency tradeoff and is computationally binding under the assumption that factoring is hard, thus improving on the previous construction by Catalano et al.
One-way functions are necessary and sufficient for secure signatures
  • J. Rompel
  • Computer Science, Mathematics
    STOC '90
  • 1990
TLDR
This paper is interested in signature schemes which are secure agMnst existential forgery under adaptive chosen message attacks, and the existence of trapdoor permutations can be shown to be necessary and sufficient for secure encryption schemes.
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange
TLDR
This paper revisits one of the most popular password-based key exchange protocols, namely the OKE (for Open Key Exchange) scheme, and presents a generic password- based key exchange construction, that admits a security proof assuming that these objects exist.
Coercion-resistant electronic elections
TLDR
A model for electronic election schemes that involves a more powerful adversary than previous work that allows the adversary to demand of coerced voters that they vote in a particular manner, abstain from voting, or even disclose their secret keys.
...
...