Sciweavers

2583 search results - page 252 / 517
» Internet Messaging Frameworks
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 11 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
ASIACRYPT
2009
Springer
15 years 10 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
15 years 9 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
15 years 7 months ago
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
Alexandra Boldyreva, Serge Fehr, Adam O'Neill
161
Voted
IKE
2007
15 years 7 months ago
A Set-Theoretic Data Model For Evolving Database Environments
The paper presents an integrated set-theoretic data model that offers a framework for defining a unified schema for any database environment. We utilise the concepts ”entity...
Emmanuel J. Yannakoudakis, Panagiotis Andrikopoulo...