Sciweavers

105 search results - page 14 / 21
» Verifying an Applicative ATP Using Multiset Relations
Sort
View
CN
2006
66views more  CN 2006»
13 years 7 months ago
Secure acknowledgment aggregation and multisignatures with limited robustness
In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. How...
Claude Castelluccia, Stanislaw Jarecki, Jihye Kim,...
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 8 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
ECWEB
2004
Springer
177views ECommerce» more  ECWEB 2004»
14 years 29 days ago
Analysis of Mobile Business Processes for the Design of Mobile Information Systems
Abstract. The adoption of mobile technologies into companies frequently follows a technology -driven approach without precise knowledge about the potential benefits that may be rea...
André Köhler, Volker Gruhn
SSIRI
2010
13 years 11 months ago
An Industrial Case Study on Speeding Up User Acceptance Testing by Mining Execution Logs
—Software reliability is defined as the probability of failure-free operation for a period of time, under certain conditions. To determine whether the reliability of an applicat...
Zhen Ming Jiang, Alberto Avritzer, Emad Shihab, Ah...
ACSAC
2002
IEEE
14 years 17 days ago
Thirty Years Later: Lessons from the Multics Security Evaluation
Almost thirty years ago a vulnerability assessment of Multics identified significant vulnerabilities, despite the fact that Multics was more secure than other contemporary (and cu...
Paul A. Karger, Roger R. Schell