Sciweavers

17 search results - page 2 / 4
» Strong Conditional Oblivious Transfer and Computing on Inter...
Sort
View
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
13 years 9 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
CCS
2010
ACM
13 years 9 months ago
Controlling data disclosure in computational PIR protocols
Private Information Retrieval (PIR) protocols allow users to learn data items stored at a server which is not fully trusted, without disclosing to the server the particular data e...
Ning Shang, Gabriel Ghinita, Yongbin Zhou, Elisa B...
AAAI
2007
13 years 7 months ago
Strongly Decomposable Voting Rules on Multiattribute Domains
Sequential composition of voting rules, by making use of structural properties of the voters’ preferences, provide computationally economical ways for making a common decision o...
Lirong Xia, Jérôme Lang, Mingsheng Yi...
TCC
2009
Springer
133views Cryptology» more  TCC 2009»
14 years 5 months ago
Composing Quantum Protocols in a Classical Environment
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...
Serge Fehr, Christian Schaffner
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
14 years 5 months ago
Security of Blind Signatures under Aborts
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
Dominique Schröder, Marc Fischlin