Sciweavers

1825 search results - page 251 / 365
» Cryptographic Securities Exchanges
Sort
View
117
Voted
CCS
2007
ACM
15 years 10 months ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.
MMSEC
2004
ACM
104views Multimedia» more  MMSEC 2004»
15 years 9 months ago
Key-assignment strategies for CPPM
CSS, the first system to protect multimedia content on the new DVD medium failed badly, because both its encryption algorithm and its key management could easily be broken. A new ...
André Adelsbach, Jörg Schwenk
CTRSA
2003
Springer
116views Cryptology» more  CTRSA 2003»
15 years 9 months ago
Intrusion-Resilient Public-Key Encryption
Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilien...
Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz...
LCN
2000
IEEE
15 years 8 months ago
Performance Impact of Data Compression on Virtual Private Network Transactions
Virtual private networks (VPNs) allow two or more parties to communicate securely over a public network. Using cryptographic algorithms and protocols, VPNs provide security servic...
John Patrick McGregor, Ruby B. Lee
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
On Robust Combiners for Private Information Retrieval and Other Primitives
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
Remo Meier, Bartosz Przydatek