Sciweavers

50 search results - page 10 / 10
» How (not) to Design RSA Signature Schemes
Sort
View
SIGCOMM
2006
ACM
13 years 11 months ago
Detecting evasion attacks at high speeds without reassembly
Ptacek and Newsham [14] showed how to evade signature detection at Intrusion Prevention Systems (IPS) using TCP and IP Fragmentation. These attacks are implemented in tools like F...
George Varghese, J. Andrew Fingerhut, Flavio Bonom...
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
13 years 9 months ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
13 years 9 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
DIM
2005
ACM
13 years 7 months ago
Pseudonym management using mediated identity-based cryptography
Mobile Location-Based Services (LBS) have raised privacy concerns amongst mobile phone users who may need to supply their identity and location information to untrustworthy third ...
Thibault Candebat, Cameron Ross Dunne, David T. Gr...
CORR
2007
Springer
153views Education» more  CORR 2007»
13 years 5 months ago
Power-Bandwidth Tradeoff in Dense Multi-Antenna Relay Networks
— We consider a dense fading multi-user network with multiple active multi-antenna source-destination pair terminals communicating simultaneously through a large common set of K ...
Ozgur Oyman, Arogyaswami Paulraj