JCSS 2006 - PDF Preprint Papers

JCSS 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCSS-2006 Paper

click to vote

JCSS
2006

102views more JCSS 2006»

Password-based authentication and key distribution protocols with perfect forward secrecy

13 years 4 months ago

Download selab.iecs.fcu.edu.tw

In an open networking environment, a workstation usually needs to identify its legal users for providing its services. Kerberos provides an efficient approach whereby a trusted th...

Hung-Min Sun, Her-Tyan Yeh

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	102	Password-based authentication and key distribution protocols with perfect forward secrecy	claim
2	89	Ramsey-type theorems for metric spaces with applications to online problems	claim
3	83	TSP with bounded metrics	claim
4	77	Sequential predictions based on algorithmic complexity	claim
5	76	How much can taxes help selfish routing?	claim
6	63	Error-bounded probabilistic computations between MA and AM	claim
7	61	Planar graphs, negative weight edges, shortest paths, and near linear time	claim
8	59	Extractors from Reed-Muller codes	claim
9	56	Determining model accuracy of network traces	claim
10	52	LWPP and WPP are not uniformly gap-definable	claim
11	51	Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS	claim
12	47	A password authentication scheme over insecure networks	claim
13	47	Maximizing data locality in distributed systems	claim
14	43	Infinite-state high-level MSCs: Model-checking and realizability	claim
15	40	A parametric analysis of the state-explosion problem in model checking	claim
16	40	Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems	claim
17	36	Minimizing maximum fiber requirement in optical networks	claim
18	35	Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers