Sciweavers

122 search results - page 12 / 25
» Modeling and analyzing security protocols in SAM: A case stu...
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
TACAS
2007
Springer
158views Algorithms» more  TACAS 2007»
14 years 1 months ago
Automatic Analysis of the Security of XOR-Based Key Management Schemes
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...
Véronique Cortier, Gavin Keighren, Graham S...
ECBS
2009
IEEE
113views Hardware» more  ECBS 2009»
14 years 2 months ago
Modeling and Analysis of Probabilistic Timed Systems
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
Abhishek Dubey, Derek Riley, Sherif Abdelwahed, Te...
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
14 years 8 months ago
Security of Blind Signatures under Aborts
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
Dominique Schröder, Marc Fischlin
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
13 years 11 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Bin Yang, Hiroshi Nakagawa