Sciweavers

86 search results - page 11 / 18
» Impossibility Results for Secret Establishment
Sort
View
EUROCRYPT
2009
Springer
14 years 8 months ago
Verifiable Random Functions from Identity-Based Key Encapsulation
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
Michel Abdalla, Dario Catalano, Dario Fiore
TRUST
2010
Springer
14 years 25 days ago
Robust Combiners for Software Hardening
All practical software hardening schemes, as well as practical encryption schemes, e.g., AES, were not proven to be secure. One technique to enhance security is robust combiners. A...
Amir Herzberg, Haya Shulman
ICISC
2008
89views Cryptology» more  ICISC 2008»
13 years 9 months ago
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Group key agreement (GKA) allows a set of players to establish a shared secret and thus bootstrap secure group communication. GKA is very useful in many types of peer group scenar...
Jihye Kim, Gene Tsudik
TIT
2011
128views more  TIT 2011»
13 years 2 months ago
Secure Network Coding on a Wiretap Network
—In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the netw...
Ning Cai, Raymond W. Yeung
ALT
2006
Springer
14 years 4 months ago
Risk-Sensitive Online Learning
We consider the problem of online learning in settings in which we want to compete not simply with the rewards of the best expert or stock, but with the best trade-off between rew...
Eyal Even-Dar, Michael J. Kearns, Jennifer Wortman