Sciweavers

3228 search results - page 394 / 646
» Computationally Sound Proofs
Sort
View
114
Voted
ACSC
2005
IEEE
15 years 9 months ago
SuperstringRep: Reputation-enhanced Service Discovery
1 Service discovery protocols are used in distributed systems to locate services for clients. The services that are located as well as the clients requesting service are commonly a...
Ryan Wishart, Ricky Robinson, Jadwiga Indulska
123
Voted
EEE
2005
IEEE
15 years 9 months ago
Service Composition in a Secure Agent-Based Architecture
We describe an agent-based situation-aware survivable architecture for the discovery and composition of web services. Our architecture provides for proofs that guaranteethe consis...
Ramesh Bharadwaj, Supratik Mukhopadhyay, Nilay Pad...
132
Voted
FSE
2005
Springer
117views Cryptology» more  FSE 2005»
15 years 9 months ago
Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model
Abstract. In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the com...
Mridul Nandi, Wonil Lee, Kouichi Sakurai, Sangjin ...
130
Voted
ICALP
2005
Springer
15 years 9 months ago
Up-to Techniques for Weak Bisimulation
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Damien Pous
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain