Sciweavers

13 search results - page 1 / 3
» General Public Key m-Out-of-n Oblivious Transfer
Sort
View
CIS
2004
Springer
13 years 10 months ago
General Public Key m-Out-of-n Oblivious Transfer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
Zhide Chen, Hong Zhu
EUROCRYPT
2005
Springer
13 years 10 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
14 years 1 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
TRUST
2010
Springer
13 years 10 months ago
Oblivious Transfer Based on Physical Unclonable Functions
us Transfer based on Physical Unclonable Functions (Extended Abstract)" Session 2 (Tuesday 15:00 - 16:30) Place: „Salon Tiergarten“ 15:00-15:30 Patrick Koeberl (Intel; Ire...
Ulrich Rührmair
ASIACRYPT
2007
Springer
13 years 11 months ago
Multi-party Indirect Indexing and Applications
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...
Matthew K. Franklin, Mark Gondree, Payman Mohassel