Sciweavers

1255 search results - page 143 / 251
» On Simple and Secure Key Distribution
Sort
View
NDSS
2008
IEEE
15 years 10 months ago
A New Privacy-Enhanced Matchmaking Protocol
Although several wide-spread internet applications (e.g., job-referral services, dating services) can benefit from online matchmaking, protocols defined over the past two decade...
Ji Sun Shin, Virgil D. Gligor
FOCS
2007
IEEE
15 years 10 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary
GLOBECOM
2006
IEEE
15 years 10 months ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
ICISC
2001
162views Cryptology» more  ICISC 2001»
15 years 5 months ago
Content Extraction Signatures
Motivated by emerging needs in online interactions, we define a new type of digital signature called a `Content Extraction Signature' (CES). A CES allows the owner, Bob, of a...
Ron Steinfeld, Laurence Bull, Yuliang Zheng
ESORICS
2010
Springer
15 years 5 months ago
A Theory of Runtime Enforcement, with Results
This paper presents a theory of runtime enforcement based on mechanism models called MRAs (Mandatory Results Automata). MRAs can monitor and transform security-relevant actions and...
Jay Ligatti, Srikar Reddy