Sciweavers

154 search results - page 28 / 31
» Proving Group Protocols Secure Against Eavesdroppers
Sort
View
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
15 years 10 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
EUROCRYPT
2010
Springer
15 years 2 months ago
Bounded Key-Dependent Message Security
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
CSFW
2010
IEEE
15 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
TRUST
2009
Springer
15 years 4 months ago
Secure VPNs for Trusted Computing Environments
Abstract. Virtual Private Networks are a popular mechanism for building complex network infrastructures. Such infrastructures are usually accompanied by strict administrative restr...
Steffen Schulz, Ahmad-Reza Sadeghi
TYPES
2004
Springer
15 years 3 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento