(Enter summary)
Abstract: . We present a commitment scheme allowing commitment to
arbitrary size integers, based on any Abelian group with certain properties,
most importantly that it is hard for the committer to compute its
order. Potential examples include RSA and class groups. We also give
e#cient zero-knowledge protocols for proving knowledge of the contents
of a commitment and for verifying multiplicative relations over the integers
on committed values. This means that our scheme can support,
for instance,... (Update)
Cited by: More
Cryptographic Randomized Response Techniques - Andris Ambainis Markus
(Correct)
Black-Box Knowledge Extraction Revisited - Universal Approach With (2006)
(Correct)
Compact E-Cash - Camenisch, Hohenberger, Lysyanskaya (2005)
(Correct)
Active bibliography (related documents): More All
0.5: The Theory and Implementation of an Electronic Voting System - Damgaard, Groth, Salomonsen (2002)
(Correct)
0.2: Zero-Knowledge Proofs for Finite Field Arithmetic, or: Can .. - Cramer, Damgård (1998)
(Correct)
0.2: Software Process Modeling using Functional Language Miranda - Matsuura, Honiden
(Correct)
Similar documents based on text: More All
0.3: Statistical Zero-Knowledge Proofs from Diophantine Equations - Lipmaa (2001)
(Correct)
0.2: Plaintext-Simulatability - Fujisaki (2004)
(Correct)
0.2: EPOC: Efficient Probabilistic Public-Key Encryption.. - Okamoto, Uchiyama.. (1998)
(Correct)
Related documents from co-citation: More All
12: Statistical zero knowledge protocols to prove modular polynomial relations (context) - Fujisaki, Okamoto - 1997
8: Statistical Zero-Knowledge Proofs from Diophantine Equations
- Lipmaa - 2001
8: Communications in Pure and Applied Mathematics (context) - Rabin, Shallit et al. - 1986
BibTeX entry: (Update)
Ivan Damg ard and Eiichiro Fujisaki. An Integer Commitment Scheme Based on Groups with Hidden Order. Technical Report 064, IACR, 13 August 2001. Available from http://eprint.iacr.org/2001/064/. http://citeseer.ist.psu.edu/ard01integer.html More
@misc{ ard01integer,
author = "I. ard and E. Fujisaki",
title = "An Integer Commitment Scheme Based on Groups with Hidden Order",
text = "Ivan Damg ard and Eiichiro Fujisaki. An Integer Commitment Scheme Based
on Groups with Hidden Order. Technical Report 064, IACR, 13 August 2001.
Available from http://eprint.iacr.org/2001/064/.",
year = "2001",
url = "citeseer.ist.psu.edu/ard01integer.html" }
Citations (may not include all citations):
6
Springer Verlag LNCS series (context) - Damgard, for et al.
5
Springer Verlag LNCS (context) - Pedersen, Information et al.
2
Springer Verlag LNCS series (context) - Okamoto, Protocols et al.
1
Shigenori Uchiyama: A New Public-Key Cryptosystem as Secure .. (context) - Okamoto
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001)
(Correct)
On the Complexity of Matsui's Attack - Junod (2001)
(Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC