Sciweavers

111 search results - page 15 / 23
» Security under key-dependent inputs
Sort
View
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
13 years 1 days ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
15 years 4 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
SP
2007
IEEE
15 years 3 months ago
Using Rescue Points to Navigate Software Recovery
We present a new technique that enables software recovery in legacy applications by retrofitting exception-handling capabilities, error virtualization using rescue points. We int...
Stelios Sidiroglou, Oren Laadan, Angelos D. Keromy...
CCS
2005
ACM
15 years 3 months ago
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
Zhenkai Liang, R. Sekar
IACR
2011
115views more  IACR 2011»
13 years 9 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky