Sciweavers

718 search results - page 100 / 144
» Security protocols, properties, and their monitoring
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 5 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
15 years 7 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
INFOCOM
2006
IEEE
15 years 8 months ago
Leveraging Channel Diversity for Key Establishment in Wireless Sensor Networks
— As the use of sensor networks increases, security in this domain becomes a very real concern. One fundamental aspect of providing confidentiality and authentication is key dis...
Matthew J. Miller, Nitin H. Vaidya
PODC
2003
ACM
15 years 7 months ago
Oblivious signature-based envelope
We propose a new cryptographic primitive called oblivious signaturebased envelope (OSBE). Informally, an OSBE scheme enables a sender to send an envelope (encrypted message) to a ...
Ninghui Li, Wenliang Du, Dan Boneh
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 1 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata