Sciweavers

570 search results - page 62 / 114
» Black-box constructions for secure computation
Sort
View
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 8 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
DSN
2005
IEEE
14 years 1 months ago
Defeating Memory Corruption Attacks via Pointer Taintedness Detection
Most malicious attacks compromise system security through memory corruption exploits. Recently proposed techniques attempt to defeat these attacks by protecting program control da...
Shuo Chen, Jun Xu, Nithin Nakka, Zbigniew Kalbarcz...
JCP
2006
120views more  JCP 2006»
13 years 8 months ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
IACR
2011
120views more  IACR 2011»
12 years 7 months ago
McOE: A Foolproof On-Line Authenticated Encryption Scheme
On-Line Authenticated Encryption (OAE) combines confidentiality with data integrity and is on-line computable. Most block cipher-based schemes for Authenticated Encryption can be ...
Ewan Fleischmann, Christian Forler, Stefan Lucks
ASIACRYPT
2003
Springer
14 years 1 months ago
Accumulating Composites and Improved Group Signing
Constructing practical and provably secure group signature schemes has been a very active research topic in recent years. A group signature can be viewed as a digital signature wit...
Gene Tsudik, Shouhuai Xu