Sciweavers

8 search results - page 2 / 2
» A Note on the Feasibility of Generalized Universal Composabi...
Sort
View
TCC
2009
Springer
177views Cryptology» more  TCC 2009»
14 years 5 months ago
Composability and On-Line Deniability of Authentication
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi ...
EOR
2007
104views more  EOR 2007»
13 years 5 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
13 years 11 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...