Sciweavers

211 search results - page 10 / 43
» A Message Recognition Protocol Based on Standard Assumptions
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
13 years 11 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
JCP
2006
120views more  JCP 2006»
13 years 7 months ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
ASIACRYPT
2008
Springer
13 years 9 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
CIKM
2007
Springer
14 years 2 months ago
Improving the classification of newsgroup messages through social network analysis
Newsgroup participants interact with their communities through conversation threads. They may respond to a message to answer a question, debate a topic, support or disagree with a...
Blaz Fortuna, Eduarda Mendes Rodrigues, Natasa Mil...
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
13 years 11 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro