Sciweavers

977 search results - page 86 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
PERCOM
2006
ACM
14 years 8 months ago
YA-TRAP: Yet Another Trivial RFID Authentication Protocol
Security and privacy in RFID systems is an important and active research area. A number of challenges arise due to the extremely limited computational, storage and communication a...
Gene Tsudik
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 10 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
SIGOPS
2011
210views Hardware» more  SIGOPS 2011»
13 years 4 months ago
Small trusted primitives for dependable systems
Secure, fault-tolerant distributed systems are difficult to build, to validate, and to operate. Conservative design for such systems dictates that their security and fault toleran...
Petros Maniatis, Byung-Gon Chun
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
14 years 9 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
ISPEC
2009
Springer
14 years 3 months ago
Hash-Based Key Management Schemes for MPEG4-FGS
We propose two symmetric-key management schemes for the encryption of scalable compressed video content. The schemes are applicable to MPEG-4 Fine Grain Scalability video coding. O...
Mohamed Karroumi, Ayoub Massoudi