Sciweavers

346 search results - page 53 / 70
» The Secret Santa Problem
Sort
View
INFOCOM
2011
IEEE
13 years 1 months ago
Hidden communication in P2P networks Steganographic handshake and broadcast
—We consider the question of how a conspiring subgroup of peers in a p2p network can find each other and communicate without provoking suspicion among regular peers or an author...
Raphael Eidenbenz, Thomas Locher, Roger Wattenhofe...
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
14 years 4 months ago
Dynamic Observers for the Synthesis of Opaque Systems
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Franck Cassez, Jérémy Dubreil, Herv&...
ASIACRYPT
2010
Springer
13 years 7 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
EDBT
2008
ACM
95views Database» more  EDBT 2008»
14 years 10 months ago
Zerber: r-confidential indexing for distributed documents
To carry out work assignments, small groups distributed within a larger enterprise often need to share documents among themselves while shielding those documents from others'...
Sergej Zerr, Elena Demidova, Daniel Olmedilla, Wol...
ISCAS
2008
IEEE
100views Hardware» more  ISCAS 2008»
14 years 4 months ago
On the security of a class of image encryption schemes
— Recently four chaos-based image encryption schemes were proposed. Essentially, the four schemes can be classified into one class, which is composed of two basic parts: permuta...
Chengqing Li, Guanrong Chen