Sciweavers

3228 search results - page 263 / 646
» Computationally Sound Proofs
Sort
View
FOCS
2003
IEEE
15 years 10 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
SRDS
2010
IEEE
15 years 2 months ago
An Entity-Centric Approach for Privacy and Identity Management in Cloud Computing
Entities (e.g., users, services) have to authenticate themselves to service providers (SPs) in order to use their services. An entity provides personally identifiable information (...
Pelin Angin, Bharat K. Bhargava, Rohit Ranchal, No...
STACS
2012
Springer
14 years 6 days ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
PLDI
2010
ACM
16 years 2 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
BMCBI
2008
80views more  BMCBI 2008»
15 years 4 months ago
Computational evaluation of TIS annotation for prokaryotic genomes
Background: Accurate annotation of translation initiation sites (TISs) is essential for understanding the translation initiation mechanism. However, the reliability of TIS annotat...
Gang-Qing Hu, Xiaobin Zheng, Li-Ning Ju, Huaiqiu Z...