Sciweavers

769 search results - page 108 / 154
» Where Is the Proof
Sort
View
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
14 years 1 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
CSFW
2010
IEEE
14 years 1 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
PODC
2010
ACM
14 years 1 months ago
Brief announcement: anonymity and trust in distributed systems
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...
ESWS
2007
Springer
14 years 1 months ago
Towards Novel Techniques for Reasoning in Expressive Description Logics based on Binary Decision Diagrams
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...
Uwe Keller
ASIACRYPT
2006
Springer
14 years 1 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang