Sciweavers

2043 search results - page 209 / 409
» Reasoning About Security Models
Sort
View
WPES
2006
ACM
16 years 6 days ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
ASIACRYPT
2000
Springer
15 years 10 months ago
Password-Authenticated Key Exchange Based on RSA
Abstract. There have been many proposals in recent years for passwordauthenticated key exchange protocols. Many of these have been shown to be insecure, and the only ones that seem...
Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan
BPM
2005
Springer
141views Business» more  BPM 2005»
15 years 11 months ago
Towards a Framework for the Agile Mining of Business Processes
Abstract. In order to support business processes effectively, their implementation by a process management systems (PMS) must be as close to the real world’s processes as possib...
Barbara Weber, Manfred Reichert, Stefanie Rinderle...
TASE
2009
IEEE
16 years 1 months ago
Verifying Self-stabilizing Population Protocols with Coq
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
Yuxin Deng, Jean-François Monin
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
16 years 19 days ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida