Sciweavers

1021 search results - page 147 / 205
» Concepts in Proof Planning
Sort
View
PODC
2010
ACM
14 years 25 days ago
Brief announcement: anonymity and trust in distributed systems
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...
SP
2010
IEEE
182views Security Privacy» more  SP 2010»
14 years 25 days ago
Object Capabilities and Isolation of Untrusted Web Applications
—A growing number of current web sites combine active content (applications) from untrusted sources, as in so-called mashups. The object-capability model provides an appealing ap...
Sergio Maffeis, John C. Mitchell, Ankur Taly
DSRT
2009
IEEE
14 years 25 days ago
Statemachine Matching in BOM Based Model Composition
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
Imran Mahmood, Rassul Ayani, Vladimir Vlassov, Far...
ACNS
2004
Springer
167views Cryptology» more  ACNS 2004»
14 years 21 days ago
A Fully-Functional Group Signature Scheme over Only Known-Order Group
The concept of group signature allows a group member to sign message anonymously on behalf of the group. In the event of a dispute, a designated entity can reveal the identity of a...
Atsuko Miyaji, Kozue Umeda
ASIACRYPT
2006
Springer
14 years 21 days ago
Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yu...