Sciweavers

132 search results - page 23 / 27
» New and improved constructions of non-malleable cryptographi...
Sort
View
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 8 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
CSREASAM
2010
13 years 4 months ago
Modeling NIDS Evasion with Genetic Programming
Nowadays, Network Intrusion Detection Systems are quickly updated in order to prevent systems against new attacks. This situation has provoked that attackers focus their efforts on...
Sergio Pastrana, Agustín Orfila, Arturo Rib...
EUROCRYPT
2007
Springer
14 years 2 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
ECCC
2007
86views more  ECCC 2007»
13 years 7 months ago
Interactive PCP
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
Yael Tauman Kalai, Ran Raz
WINET
2010
224views more  WINET 2010»
13 years 6 months ago
Hierarchical geographic multicast routing for wireless sensor networks
Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices. In such networks, multicast is a fundamental routing servi...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...