NDLI: Reducing Complexity Assumptions for Statistically-Hiding Commitment

Content Provider	Springer Nature Link
Author	Haitner, Iftach Horvitz, Omer Katz, Jonathan Koo, Chiu Yuen Morselli, Ruggero Shaltiel, Ronen
Copyright Year	2007
Abstract	We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way permutation. We improve upon this by showing a construction based on any approximable preimage-size one-way function. These are one-way functions for which it is possible to efficiently approximate the number of pre-images of a given output. A special case is the class of regular one-way functions where all points in the image of the function have the same (known) number of pre-images. We also prove two additional results related to statistically-hiding commitment. First, we prove a (folklore) parallel composition theorem showing, roughly speaking, that the statistical hiding property of any such commitment scheme is amplified exponentially when multiple independent parallel executions of the scheme are carried out. Second, we show a compiler which transforms any commitment scheme which is statistically hiding against an honest-but-curious receiver into one which is statistically hiding even against a malicious receiver.
Starting Page	283
Ending Page	310
Page Count	28
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	22
Issue Number	3
e-ISSN	14321378
Language	English
Publisher	Springer-Verlag
Publisher Date	2007-09-22
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Bit commitment Statistical hiding Regular one way functions Communications Engineering, Networks Probability Theory and Stochastic Processes Combinatorics Computational Mathematics and Numerical Analysis Coding and Information Theory
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the existence of statistically hiding bit commitment schemes and fail-stop signatures

A New Interactive Hashing Theorem

Secure Classical Bit Commitment Using Fixed Capacity Communication Channels

Leakage-Resilient Cryptography from Minimal Assumptions

A One-Time Stegosystem and Applications to Efficient Covert Communication

Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

A Note on Negligible Functions

Complexity Bounds on General Hard-Core Predicates

New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups

Reducing Complexity Assumptions for Statistically-Hiding Commitment

Similar Documents

On the existence of statistically hiding bit commitment schemes and fail-stop signatures

A New Interactive Hashing Theorem

Secure Classical Bit Commitment Using Fixed Capacity Communication Channels

Leakage-Resilient Cryptography from Minimal Assumptions

A One-Time Stegosystem and Applications to Efficient Covert Communication

Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

A Note on Negligible Functions

Complexity Bounds on General Hard-Core Predicates

New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups

Reducing Complexity Assumptions for Statistically-Hiding Commitment