Sciweavers

3228 search results - page 549 / 646
» Computationally Sound Proofs
Sort
View
DSOM
2007
Springer
15 years 11 months ago
Efficient Web Services Event Reporting and Notifications by Task Delegation
Web Services are an XML technology recently viewed as capable of being used for network management. A key aspect of WS in this domain is event reporting. WS-based research in this ...
Aimilios Chourmouziadis, George Pavlou
OTM
2007
Springer
15 years 11 months ago
Bayesian Analysis of Secure P2P Sharing Protocols
Ad hoc and peer-to-peer (P2P) computing paradigms pose a number of security challenges. The deployment of classic security protocols to provide services such as node authentication...
Esther Palomar, Almudena Alcaide, Juan M. Est&eacu...
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
15 years 11 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
162
Voted
TACAS
2007
Springer
124views Algorithms» more  TACAS 2007»
15 years 11 months ago
Deciding Bit-Vector Arithmetic with Abstraction
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...
Randal E. Bryant, Daniel Kroening, Joël Ouakn...
122
Voted
TAMC
2007
Springer
15 years 11 months ago
On Deciding Deep Holes of Reed-Solomon Codes
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
Qi Cheng, Elizabeth Murray