Sciweavers

53327 search results - page 10403 / 10666
» or 2007
Sort
View
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
16 years 8 days 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
2007
Springer
104views Cryptology» more  TCC 2007»
16 years 8 days ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
16 years 8 days ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
138
Voted
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
16 years 8 days ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
16 years 8 days ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
« Prev « First page 10403 / 10666 Last » Next »