Sciweavers

195 search results - page 27 / 39
» Security and Privacy Using One-Round Zero-Knowledge Proofs
Sort
View
EUROCRYPT
2010
Springer
15 years 4 months ago
Bounded Key-Dependent Message Security
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
CSFW
2007
IEEE
15 years 6 months ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
ACSAC
1999
IEEE
15 years 4 months ago
Non-repudiation Evidence Generation for CORBA using XML
This paper focuses on the provision of a nonrepudiation service for CORBA. The current OMG specification of a CORBA non-repudiation service forces the programmer to augment the ap...
Michael Wichert, David B. Ingham, Steve J. Caughey
CCS
2005
ACM
15 years 5 months ago
PeerAccess: a logic for distributed authorization
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
Marianne Winslett, Charles C. Zhang, Piero A. Bona...
CODASPY
2012
13 years 7 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...