Sciweavers

876 search results - page 39 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
ICISS
2009
Springer
14 years 5 months ago
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowled...
Michael K. Reiter, Vyas Sekar, Chad Spensky, Zheng...
SYNASC
2007
IEEE
142views Algorithms» more  SYNASC 2007»
14 years 5 months ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza
CRYPTO
2003
Springer
95views Cryptology» more  CRYPTO 2003»
14 years 4 months ago
Plaintext Awareness via Key Registration
Abstract. In this paper, we reconsider the notion of plaintext awareness. We present a new model for plaintext-aware encryption that is both natural and useful. We achieve plaintex...
Jonathan Herzog, Moses Liskov, Silvio Micali
IEICET
2008
93views more  IEICET 2008»
13 years 10 months ago
Compression Functions Suitable for the Multi-Property-Preserving Transform
Since Bellare and Ristenpart showed a multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to th...
Hidenori Kuwakado, Masakatu Morii
PODC
2003
ACM
14 years 4 months ago
An asynchronous protocol for distributed computation of RSA inverses and its applications
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
Christian Cachin