Sciweavers

860 search results - page 27 / 172
» Completeness in two-party secure computation: a computationa...
Sort
View
CVPR
2003
IEEE
16 years 8 months ago
The Viewing Graph
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
Noam Levi, Michael Werman
STACS
2010
Springer
16 years 1 months ago
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
ISW
2010
Springer
15 years 4 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
FC
2010
Springer
171views Cryptology» more  FC 2010»
15 years 10 months ago
The Phish-Market Protocol: Securely Sharing Attack Data between Competitors
A key way in which banks mitigate the effects of phishing is to remove fraudulent websites or suspend abusive domain names. This ‘take-down’ is often subcontracted to special...
Tal Moran, Tyler Moore
JOC
2006
69views more  JOC 2006»
15 years 6 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung