Sciweavers

977 search results - page 86 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
121
Voted
PERCOM
2006
ACM
16 years 2 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
145
Voted
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 3 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
137
Voted
SIGOPS
2011
210views Hardware» more  SIGOPS 2011»
14 years 9 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
125
Voted
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 3 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
154
Voted
ISPEC
2009
Springer
15 years 9 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