Sciweavers

53 search results - page 3 / 11
» Minimal Complete Primitives for Secure Multi-party Computati...
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 5 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
STACS
1992
Springer
13 years 9 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...
CCS
2009
ACM
13 years 3 months ago
RFID privacy: relation between two notions, minimal condition, and efficient construction
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
Changshe Ma, Yingjiu Li, Robert H. Deng, Tieyan Li
HICSS
2011
IEEE
196views Biometrics» more  HICSS 2011»
12 years 9 months ago
XTRec: Secure Real-Time Execution Trace Recording on Commodity Platforms
We propose XTRec, a primitive that can record the instruction-level execution trace of a commodity computing system. Our primitive is resilient to compromise to provide integrity ...
Amit Vasudevan, Ning Qu, Adrian Perrig
CCS
2005
ACM
13 years 11 months ago
Untraceable RFID tags via insubvertible encryption
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
Giuseppe Ateniese, Jan Camenisch, Breno de Medeiro...