Sciweavers

1656 search results - page 72 / 332
» Secure Computation Without Authentication
Sort
View
IACR
2011
212views more  IACR 2011»
14 years 12 days ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
105
Voted
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 1 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
108
Voted
IDTRUST
2009
ACM
15 years 7 months ago
Personal identity verification (PIV) cards as federated identities: challenges and opportunities
In this paper, we describe the challenges in using Personal Identity Verification (PIV) cards and PIV-like cards as federated identities to authenticate to US Federal government f...
Sarbari Gupta
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
15 years 19 days ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
116
Voted
CCS
2011
ACM
14 years 22 days ago
Fortifying web-based applications automatically
Browser designers create security mechanisms to help web developers protect web applications, but web developers are usually slow to use these features in web-based applications (...
Shuo Tang, Nathan Dautenhahn, Samuel T. King