Sciweavers

40 search results - page 7 / 8
» Constant Round Dynamic Group Key Agreement
Sort
View
ASIACRYPT
2007
Springer
14 years 1 months ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
13 years 11 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
ICISC
2008
126views Cryptology» more  ICISC 2008»
13 years 9 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
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
CN
2007
117views more  CN 2007»
13 years 7 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...