Sciweavers

1562 search results - page 77 / 313
» Mathematics, Cryptology, Security
Sort
View
EUROCRYPT
2010
Springer
13 years 8 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
EUROCRYPT
2011
Springer
12 years 11 months ago
Concurrent Composition in the Bounded Quantum Storage Model
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
Dominique Unruh
FOSAD
2000
Springer
13 years 11 months ago
Security Goals: Packet Trajectories and Strand Spaces
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
Joshua D. Guttman
EUROCRYPT
2007
Springer
14 years 1 days ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
CTRSA
2005
Springer
154views Cryptology» more  CTRSA 2005»
14 years 1 months ago
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability ...
Tsz Hon Yuen, Victor K. Wei