Sciweavers

783 search results - page 41 / 157
» On security proof of McCullagh
Sort
View
CCS
2006
ACM
14 years 1 months ago
Ring signatures without random oracles
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...
EUROCRYPT
2006
Springer
14 years 1 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
FASE
2009
Springer
14 years 4 months ago
A Formal Connection between Security Automata and JML Annotations
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
Marieke Huisman, Alejandro Tamalet
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 3 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
ISF
2007
121views more  ISF 2007»
13 years 9 months ago
Virtual organization security policies: An ontology-based integration approach
Abstract This paper addresses the specification of a security policy ontology framework to mediate security policies between virtual organizations (VO) and real organizations (RO)....
Saravanan Muthaiyah, Larry Kerschberg