Sciweavers

25 search results - page 5 / 5
» Characterization of TCC on Chip-Multiprocessors
Sort
View
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
14 years 2 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
13 years 11 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
TCC
2010
Springer
176views Cryptology» more  TCC 2010»
14 years 2 months ago
Ideal Hierarchical Secret Sharing Schemes
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...
Oriol Farràs, Carles Padró
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 2 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 6 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...