Sciweavers

1656 search results - page 94 / 332
» Secure Computation Without Authentication
Sort
View
TC
2008
15 years 18 days ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...
198
Voted
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
16 years 25 days ago
GhostDB: querying visible and hidden data without leaks
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Phil...
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
15 years 6 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
118
Voted
TPDS
2008
116views more  TPDS 2008»
15 years 18 days ago
Pseudo Trust: Zero-Knowledge Authentication in Anonymous P2Ps
Most trust models in Peer-to-Peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence,...
Li Lu, Jinsong Han, Yunhao Liu, Lei Hu, Jinpeng Hu...
CCS
2010
ACM
15 years 27 days ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann