Filters








13,304 Hits in 6.5 sec

Time-stamping with binary linking schemes [chapter]

Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Villemson
1998 Lecture Notes in Computer Science  
We state the basic requirements for time-stamping systems applicable as the necessary support to the legal use of electronic documents.  ...  We analyze the main drawbacks of the time-stamping systems proposed to date and present a new system that meets all the stated requirements.  ...  The reasoning about the time-stamping procedures creates the need for a formal apparatus capable to prove the security of time-stamping protocols, in a way similar to how the BAN-style logics [BAN89] are  ... 
doi:10.1007/bfb0055749 fatcat:poxt2pah6fcb5i26kg6o2arz7q

Secure time-stamping schemes: a distributed point of view

Alexis Bonnecaze, Pierre Liardet, Alban Gabillon, Kaouther Blibech
2006 Annales des télécommunications  
This scheme appears to be a trusted and reliable distributed time-stamping scheme.  ...  Liardet is with LATP, Time-stamping is a technique used to prove the existence of a digital document prior to a specific point in time.  ...  Linking schemes have been developped in order to be able to detect fake time-stamps produced by a malicious TSA. Linking schemes consist in chronologically linking the time-stamp tokens.  ... 
doi:10.1007/bf03219928 fatcat:bfnqp3tsp5ezbhac3nr22n7gju

Towards an XML format for time-stamps

Karel Wouters, Bart Preneel, Ana Isabel González-Tablas, Arturo Ribagorda
2002 Proceedings of the 2002 ACM workshop on XML security - XMLSEC '02  
Some ASN.1-based formats for time-stamp protocols have been defined within IETF and ISO/IEC.  ...  In recent work by ETSI on XML digital signatures conforming to European legislation, time-stamps play a key role for qualified digital signatures.  ...  This element contains the binding information for linked time-stamps. With these elements every time-stamp token of the simple and linked schemes can be constructed.  ... 
doi:10.1145/764792.764802 dblp:conf/xmlsec/WoutersPFR02 fatcat:u6izo5kuyvdmlf55dlc6zp7vcu

Towards an XML format for time-stamps

Karel Wouters, Bart Preneel, Ana Isabel González-Tablas, Arturo Ribagorda
2002 Proceedings of the 2002 ACM workshop on XML security -  
Some ASN.1-based formats for time-stamp protocols have been defined within IETF and ISO/IEC.  ...  In recent work by ETSI on XML digital signatures conforming to European legislation, time-stamps play a key role for qualified digital signatures.  ...  This element contains the binding information for linked time-stamps. With these elements every time-stamp token of the simple and linked schemes can be constructed.  ... 
doi:10.1145/764800.764802 fatcat:mnxyvfk445g2rckrvxl6f6ztlu

On the design of time-stamped signatures

Hung-Min Sun, Bing-Chang Chen, Her-Tyan Yeh
2004 Journal of computer and system sciences (Print)  
Based on relative temporal authentication, several linking schemes for digital time-stamping have been proposed to solve this problem.  ...  To combat the collusion problem, time-stamped signature schemes with hybrid temporal authentication are therefore proposed. r  ...  For simplicity, we only show how to combine the nothing hidden timestamped signature scheme proposed in Section 4.1, with the binary linking scheme [7, 8] into a time-stamped signature scheme with HTA  ... 
doi:10.1016/j.jcss.2003.10.003 fatcat:6wxr4leelratvch6cwuhqx6dju

Improving the Availability of Time-Stamping Services [chapter]

Arne Ansper, Ahto Buldas, Märt Saarepera, Jan Willemson
2001 Lecture Notes in Computer Science  
We introduce fault-tolerant linking as a new concept to neutralize fault-sensitivity as the main weakness of linkage-based time-stamping.  ...  We discuss the availability questions that arise when digital time stamps are used for preserving the evidentiary value of electronic documents.  ...  the general linking scheme, H n−1 may comprise relatively old m , with m n.  ... 
doi:10.1007/3-540-47719-5_29 fatcat:wb276sgqjvhwzc3c24l3lf4dse

Optimally Efficient Accountable Time-Stamping [chapter]

Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
2000 Lecture Notes in Computer Science  
Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds.  ...  We investigate the paradigm of time-stamping services based on simply connected graphs, and propose a simple, yet optimal, accountable time-stamping service, using what we call threaded tree schemes.  ...  Time-Stamping Objectives A stamping service consists of a set of principals with the time-stamping authority (TSA) and the publication authority (PA) together with a quadruple (S, C, V, P ) of protocols  ... 
doi:10.1007/978-3-540-46588-1_20 fatcat:z2dhqijgizcrhiu7xzrm6xdngu

Integrating XML Linked Time-Stamps in OASIS Digital Signature Services [chapter]

Ana Isabel González-Tablas, Karel Wouters
2005 Lecture Notes in Computer Science  
Linked time-stamps have an advantage over these simple time-stamps because they construct a verifiable link between time-stamps.  ...  We highlight the problem points when introducing a sub-profile of this standard, and we describe some additional structures that are needed to accommodate a broad range of linked time-stamping schemes.  ...  Implementation To implement the scheme, we can start from a standard DSS implementation, with adjustments to handle linked time-stamp requests.  ... 
doi:10.1007/11552055_40 fatcat:dks4czggy5a6xc22zutbp3laue

CPR Verification Analysis Based on TSA

Zhi-qiang LIU
2019 DEStech Transactions on Computer Science and Engineering  
Time stamp protocol is a message encryption protocol based on Hash function. This paper presents a scheme of electronic medical record authentication system based on timestamp protocol.  ...  records and authentication time.  ...  The system time-stamping process adopts the protocol, which combines the binary tree simplified scheme and the link list scheme to facilitate storage of signatories and verification.  ... 
doi:10.12783/dtcse/cscme2019/32557 fatcat:exmur7lwyjfx5p7omklseyq6ve

Using Web Services Technology for Inter-enterprise Integration of Digital Time Stamping [chapter]

A. Cilardo, A. Mazzeo, L. Romano, G. P. Saggese, G. Cattaneo
2003 Lecture Notes in Computer Science  
We propose a practical architecture which provides time stamping services, both in terms of relative temporal authentication, based on a linear linking scheme, and of absolute temporal authentication,  ...  State-of-the-art time stamping algorithms and crucial issues related to their practical implementation are discussed.  ...  The basic idea behind the linking scheme is to generate a time stamp which involves data included in other time stamps.  ... 
doi:10.1007/978-3-540-39962-9_93 fatcat:q33fy5aatneghhl3qppu3y533q

Improving the Efficiency and Reliability of Digital Time-Stamping [chapter]

Dave Bayer, Stuart Haber, W. Scott Stornetta
1993 Sequences II  
Haber and Stornetta have proposed two schemes for digital time-stamping which rely on these principles [HaSt 91].  ...  We reexamine one of those protocols, addressing the resource constraint required for storage and verification of time-stamp certificates.  ...  This can be applied to digital signatures, or to time-stamping itself, making the digital time-stamping process renewable.  ... 
doi:10.1007/978-1-4613-9323-8_24 fatcat:jkpnql4hvvfw3jafilhpf4t6jy

A Preemptive Link State Spanning Tree Source Routing Scheme For Opportunistic Data Forwarding In Manet

R. Poonkuzhali, M. Y. Sanavullah, A. Sabari
2014 Zenodo  
The update messages in PLSR are integrated into a tree structure and no need to time stamp routing updates which reduces the routing overhead.  ...  In this all the tree updates are performed differently and the link states are time stamped.  ...  CONCLUSION Opportunistic data forwarding is achieved using preemptive link state spanning tree routing scheme (PLSRP).  ... 
doi:10.5281/zenodo.1093535 fatcat:by4bqdl2j5h7zictjw4uvynybq

Extending micro-contact printing for patterning complex polymer brush microstructures

Tao Chen, Rainer Jordan, Stefan Zauscher
2011 Polymer  
Here we exploited several extended mCP strategies with various printing conditions (over-force or swelling induced physical deformation, and UV-Ozone treated chemical surface modification to a PDMS stamp  ...  ), combining with surface initiated atom transfer radical polymerization (SI-ATRP), to pattern complex poly(N-isopropylacrylamide) (PNIPAAM) brush microstructures.  ...  (C) Binary polymer brush obtained after swelling induced mCP, w50 g. (D) Binary polymer brush obtained after swelling and force direction induced mCP, w500 g. All the contact time is 20 s.  ... 
doi:10.1016/j.polymer.2011.04.008 fatcat:fztuwvvx2fb5roh6xazmrlxtym

Page 4545 of Mathematical Reviews Vol. , Issue 2000f [page]

2000 Mathematical Reviews  
In Section 4 the protocols of the new time-stamping system are described using the linear linking scheme.  ...  A new scheme that is tightly optimal in the general case is proposed.” Contents: 1. Prerequisites; 2. Existing time-stamping systems; 3. Security objectives; 4. Accumulated linear linking scheme; 5.  ... 

Distributed Timestamp Mechanism Based on Verifiable Delay Functions

Qiang Wu, Zhaoyang Han, Ghulam Mohiuddin, Yongjun Ren
2023 Computer systems science and engineering  
In the data communication system, the real-time information interaction of communication device increases the risk of privacy sensitive data being tampered with.  ...  The experimental results also show that the scheme greatly improves the efficiency of digital signatures.  ...  The tree linking scheme [26] and binary linking scheme [27, 28] further improve linear linking scheme. But such protocols only provide relative timestamps, which cannot satisfy some applications.  ... 
doi:10.32604/csse.2023.030646 fatcat:hgl47wktgzhw5oyaffilxzcm2e
« Previous Showing results 1 — 15 out of 13,304 results