Sciweavers

1058 search results - page 112 / 212
» Secure Group Communications Using Key Graphs
Sort
View
FOCS
2006
IEEE
16 years 10 days ago
Cryptography from Anonymity
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
COMCOM
2006
154views more  COMCOM 2006»
15 years 6 months ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia
ACMICEC
2003
ACM
144views ECommerce» more  ACMICEC 2003»
15 years 11 months ago
Security model for a multi-agent marketplace
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
Ashutosh Jaiswal, Yongdae Kim, Maria L. Gini
IJNSEC
2011
239views more  IJNSEC 2011»
15 years 1 months ago
Digital Signature Scheme with Message Recovery Using Knapsack-based ECC
Digital signature authentication scheme provides secure communication between two users. Digital signatures guarantee end-to-end message integrity and authentication information a...
R. Rajaram Ramasamy, M. Amutha Prabakar
SCN
2010
Springer
163views Communications» more  SCN 2010»
15 years 4 months ago
Time-Specific Encryption
This paper introduces and explores the new concept of Time-Specific Encryption (TSE). In (Plain) TSE, a Time Server broadcasts a key at the beginning of each time unit, a Time Inst...
Kenneth G. Paterson, Elizabeth A. Quaglia