Sciweavers

1458 search results - page 109 / 292
» The sequentially realizable functionals
Sort
View
158
Voted
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 4 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
163
Voted
CCECE
2006
IEEE
15 years 9 months ago
A Software Defined Radio Receiver Architecture for UWB Communications and Positioning
A software defined radio (SDR) receiver architecture is proposed in this paper for ultra-wideband (UWB) applications. Both UWB data communication and positioning functions are imp...
Yanyang Zhao, Ligen Wang, Jean-François Fri...
162
Voted
FSTTCS
2005
Springer
15 years 9 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
128
Voted
VL
1996
IEEE
105views Visual Languages» more  VL 1996»
15 years 7 months ago
Enhancing Iconic Program Reusability with Object Sharing
This paper describes how to improve the reusability of iconic program modules. In iconic programming systems, the most important features for reuse are the customization of a modu...
Yuichi Koike, Yasuyuki Maeda, Yoshiyuki Koseki
129
Voted
EUROCRYPT
2006
Springer
15 years 7 months ago
Private Circuits II: Keeping Secrets in Tamperable Circuits
Abstract. Motivated by the problem of protecting cryptographic hardware, we continue the investigation of private circuits initiated in [16]. In this work, our aim is to construct ...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai, David ...