Sciweavers

2363 search results - page 196 / 473
» How Secure is RFID
Sort
View
195
Voted
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 7 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
WISA
2009
Springer
16 years 2 months ago
Securing Remote Access Inside Wireless Mesh Networks
Wireless mesh networks (WMNs) that are being increasingly deployed in communities and public places provide a relatively stable routing infrastructure and can be used for diverse c...
Mark Manulis
CCS
2004
ACM
16 years 26 days ago
KNOW Why your access was denied: regulating feedback for usable security
We examine the problem of providing useful feedback about access control decisions to users while controlling the disclosure of the system’s security policies. Relevant feedback...
Apu Kapadia, Geetanjali Sampemane, Roy H. Campbell
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 26 days ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 12 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård