Sciweavers

3504 search results - page 257 / 701
» Secure protocol composition
Sort
View
ESORICS
2010
Springer
15 years 7 months ago
Election Verifiability in Electronic Voting Protocols
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
Steve Kremer, Mark Ryan, Ben Smyth
EUROCRYPT
2009
Springer
16 years 7 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
CCS
2007
ACM
16 years 23 days ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
TOOLS
1999
IEEE
15 years 11 months ago
Bounding Component Behavior via Protocols
In this paper we enhance the SOFA Component Description Language with a semantic description of a component's functionality. There are two key requirements this description a...
Frantisek Plasil, Milos Besta, Stanislav Visnovsky
WISTP
2009
Springer
16 years 1 months ago
Performance Issues of Selective Disclosure and Blinded Issuing Protocols on Java Card
Abstract. In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing [1]. The performance is relati...
Hendrik Tews, Bart Jacobs