Sciweavers

658 search results - page 48 / 132
» Open problems in the security of learning
Sort
View
ISI
2006
Springer
13 years 9 months ago
Inferring Privacy Information from Social Networks
Since privacy information can be inferred via social relations, the privacy confidentiality problem becomes increasingly challenging as online social network services are more popu...
Jianming He, Wesley W. Chu, Zhenyu Liu
JIPS
2007
223views more  JIPS 2007»
13 years 8 months ago
Addressing Mobile Agent Security through Agent Collaboration
: The use of agent paradigm in today’s applications is hampered by the security concerns of agents and hosts alike. The agents require the presence of a secure and trusted execut...
Evens Jean, Yu Jiao, Ali R. Hurson
RFIDSEC
2010
13 years 7 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 1 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
ASIACRYPT
2008
Springer
13 years 10 months ago
MPC vs. SFE : Unconditional and Computational Security
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
Martin Hirt, Ueli M. Maurer, Vassilis Zikas