A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order

By Ivan Bjerre Damgård, Eiichiro Fujisaki. International Conference on the Theory and Application of Cryptology and Information Security, 2002

331 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/83fa887042a57b370c858bf5c499ba9cecdfd7a1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Transparent SNARKs from DARK Compilers (2020, background): “Arguments based on hidden order groups Fujisaki and Okamoto [29] proposed homomorphic integer commitment schemes based on the RSA group.”
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012, methodology): “Sketching the solution, the core idea is to commit to α using a homomorphic integer commitment scheme; the typical suggestion is schemes such as [21,33].”
Privacy and accountability for location-based aggregate statistics (2011, background): “[11] prove that Step 4 will happen in expected polynomial time, if the strong RSA assumption holds.”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, background): “, G = Z), and can be used very efficiently if assumptions on the homomorphism φ are made [45,46].”
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008, background): “Damg̊ard and Fujisaki [11] have suggested an alternative definition of an argument of knowledge in the presence of a common random string.”
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash (2010, background): “The high-level nature of our language brings two benefits.”
Traceable Signatures (2004, background): “[12, 11](also, various discrete-log based protocols over known and unknown order subgroups have been utilized extensively in the literature, [16, 19, 17]).”
Distributed Paillier Cryptosystem without Trusted Dealer (2010, background): “There exists a VSS scheme over the integers based on a composite (RSA) number such as [16], but as pointed out in [2,20], we need a trusted setup to obtain such a shared composite number which is a product of two safe primes and we want to avoid the trusted setup.”
Efficient Protocols for Set Membership and Range Proofs (2008, methodology): “Then we will study the commitment scheme presented by Ivan Damgård and Eiichiro Fujisaki in [7], together with a proof of knowledge and amultiplicative proof.”
Efficient, Robust and Constant-Round Distributed RSA Key Generation (2010, unknown): “Fujisaki and Okamoto [15](see Damg̊ard and Fujisaki [10] for a revised version) describes an integer commitment scheme, which is additively homomorph and can be simulated in UC in the CRS model.”