Sciweavers

719 search results - page 100 / 144
» Proving Security Protocols Correct
Sort
View
WDAG
1992
Springer
104views Algorithms» more  WDAG 1992»
15 years 1 months ago
Choice Coordination with Multiple Alternatives (Preliminary Version)
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang
CORR
2008
Springer
109views Education» more  CORR 2008»
14 years 9 months ago
Compactly accessible categories and quantum key distribution
Abstract. Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based con...
Chris Heunen
NDSS
2009
IEEE
15 years 4 months ago
The Blind Stone Tablet: Outsourcing Durability to Untrusted Parties
We introduce a new paradigm for outsourcing the durability property of a multi-client transactional database to an untrusted service provider. Specifically, we enable untrusted s...
Peter Williams, Radu Sion, Dennis Shasha
DRMTICS
2005
Springer
15 years 3 months ago
Algorithms to Watermark Software Through Register Allocation
Software security is a significant issue in the Internet age. In order to prevent software from piracy and unauthorized modification, many techniques have been developed. Softwar...
William Zhu, Clark D. Thomborson
JOC
2007
133views more  JOC 2007»
14 years 9 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin