Sciweavers

1612 search results - page 84 / 323
» About models of security protocols
Sort
View
106
Voted
CARDIS
2010
Springer
168views Hardware» more  CARDIS 2010»
15 years 10 months ago
Secure Delegation of Elliptic-Curve Pairing
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...
Benoît Chevallier-Mames, Jean-Sébasti...
153
Voted
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
15 years 5 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
111
Voted
FC
2007
Springer
138views Cryptology» more  FC 2007»
15 years 10 months ago
Cryptographic Securities Exchanges
While transparency in financial markets should enhance liquidity, its exploitation by unethical and parasitic traders discourages others from fully embracing disclosure of their o...
Christopher Thorpe, David C. Parkes
126
Voted
ATAL
2010
Springer
15 years 4 months ago
Model checking detectability of attacks in multiagent systems
Information security is vital to many multiagent system applications. In this paper we formalise the notion of detectability of attacks in a MAS setting and analyse its applicabil...
Ioana Boureanu, Mika Cohen, Alessio Lomuscio
147
Voted
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
15 years 7 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth