Sciweavers

3115 search results - page 452 / 623
» Synthesizing Secure Protocols
Sort
View
188
Voted
IACR
2011
94views more  IACR 2011»
14 years 6 months ago
After-the-Fact Leakage in Public-Key Encryption
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
Shai Halevi, Huijia Lin
177
Voted
ACSC
2008
IEEE
16 years 1 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
FC
2007
Springer
125views Cryptology» more  FC 2007»
16 years 1 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
SIGCOMM
2005
ACM
16 years 16 days ago
Declarative routing: extensible routing with declarative queries
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, ...
213
Voted
ASIACRYPT
2011
Springer
14 years 7 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...