Sciweavers

469 search results - page 84 / 94
» On Adversary Models and Compositional Security
Sort
View
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 8 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 1 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
ASIACRYPT
2001
Springer
14 years 4 days ago
Key-Privacy in Public-Key Encryption
We consider a novel security requirement of encryption schemes that we call “key-privacy” or “anonymity”. It asks that an eavesdropper in possession of a ciphertext not be ...
Mihir Bellare, Alexandra Boldyreva, Anand Desai, D...
TDP
2010
189views more  TDP 2010»
13 years 2 months ago
The PROBE Framework for the Personalized Cloaking of Private Locations
The widespread adoption of location-based services (LBS) raises increasing concerns for the protection of personal location information. A common strategy, referred to as obfuscati...
Maria Luisa Damiani, Elisa Bertino, Claudio Silves...
IJSN
2008
147views more  IJSN 2008»
13 years 7 months ago
Formal modelling and analysis of XML firewall for service-oriented systems
: Firewalls have been designed as a major component to protect a network or a server from being attacked. However, due to their emphasis on packet filtering rather than verifying u...
Haiping Xu, Mihir M. Ayachit, Abhinay Reddyreddy