Sciweavers

783 search results - page 88 / 157
» On security proof of McCullagh
Sort
View
EUROCRYPT
2010
Springer
13 years 9 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
IJNSEC
2006
122views more  IJNSEC 2006»
13 years 8 months ago
A Directed Signature Scheme Based on RSA Assumption
A directed signature scheme allows a designated verifier to directly verify a signature issued to him, and a third party to check the signature validity with the help of the signe...
Rongxing Lu, Zhenfu Cao
ESORICS
2002
Springer
14 years 8 months ago
Computational Probabilistic Non-interference
In recent times information flow and non-interference have become very popular concepts for expressing both integrity and privacy properties. We present the first general definitio...
Michael Backes, Birgit Pfitzmann
CSFW
2007
IEEE
14 years 3 months ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
TCC
2004
Springer
105views Cryptology» more  TCC 2004»
14 years 2 months ago
Unfair Noisy Channels and Oblivious Transfer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
Ivan Damgård, Serge Fehr, Kirill Morozov, Lo...