NDLI: Non-interactive Timestamping in the Bounded-Storage Model

Content Provider	Springer Nature Link
Author	Moran, Tal Shaltiel, Ronen Ta Shma, Amn
Copyright Year	2009
Abstract	A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Interactive timestamping has many advantages, such as information theoretic privacy and enhanced robustness. Non-Interactive timestamping, however, is not possible against polynomial-time adversaries that have unbounded storage at their disposal. As a result, no non-interactive timestamping schemes were constructed up to date.In this paper we show that non-interactive timestamping is possible in the bounded-storage model, i.e., if the adversary has bounded storage, and a long random string is broadcast to all players. To the best of our knowledge, this is the first example of a cryptographic task that is possible in the bounded-storage model but is impossible in the “standard cryptographic setting,” even when assuming “standard” cryptographic assumptions.We give an explicit construction that is secure against all bounded storage adversaries and a significantly more efficient construction secure against all bounded storage adversaries that run in polynomial time.
Starting Page	189
Ending Page	226
Page Count	38
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	22
Issue Number	2
e-ISSN	14321378
Language	English
Publisher	Springer-Verlag
Publisher Date	2009-01-10
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Timestamping Bounded-storage model Unbalanced expander graphs Randomness extractors 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

Constant-Round Oblivious Transfer in the Bounded Storage Model

Cryptographic Hash Functions from Expander Graphs

Non-malleable Coding Against Bit-Wise and Split-State Tampering

Randomness versus Fault-Tolerance

Short Non-Interactive Cryptographic Proofs

Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

OAEP Reconsidered

Editor's Foreword

A Software-Optimized Encryption Algorithm

Non-interactive Timestamping in the Bounded-Storage Model

Similar Documents

Constant-Round Oblivious Transfer in the Bounded Storage Model

Cryptographic Hash Functions from Expander Graphs

Non-malleable Coding Against Bit-Wise and Split-State Tampering

Randomness versus Fault-Tolerance

Short Non-Interactive Cryptographic Proofs

Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

OAEP Reconsidered

Editor's Foreword

A Software-Optimized Encryption Algorithm

Non-interactive Timestamping in the Bounded-Storage Model