Sciweavers

610 search results - page 60 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
FC
2009
Springer
134views Cryptology» more  FC 2009»
15 years 6 months ago
Cryptographic Combinatorial Securities Exchanges
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Christopher Thorpe, David C. Parkes
ICC
2007
IEEE
157views Communications» more  ICC 2007»
15 years 6 months ago
Secure Aggregation in Sensor Networks Using Neighborhood Watch
Abstract— Many sensor networks (SN) use in-network aggregation to minimize the amount of data transmitted by sensors. Unfortunately, aggregation makes the network more vulnerable...
Paul Rabinovich, Robert Simon
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
15 years 3 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Bin Yang, Hiroshi Nakagawa
EUROCRYPT
2010
Springer
15 years 4 months ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
EDCC
1994
Springer
15 years 4 months ago
Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach
Security and reliability issues in distributed systems have been investigated for several years at LAAS using a technique called Fragmentation-Redundancy-Scattering (FRS). The aim ...
Jean-Charles Fabre, Yves Deswarte, Brian Randell