Sciweavers

1401 search results - page 259 / 281
» Randomness in Interactive Proofs
Sort
View
CCS
2006
ACM
15 years 1 months ago
Safety and consistency in policy-based authorization systems
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
Adam J. Lee, Marianne Winslett
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
15 years 1 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
ASIACRYPT
2008
Springer
14 years 11 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
BIRD
2008
Springer
109views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
A Robust Class of Stable Proteins in the 2D HPC Model
The inverse protein folding problem is that of designing an amino acid sequence which has a prescribed native protein fold. This problem arises in drug design where a particular st...
Alireza Hadj Khodabakhshi, Ján Manuch, Aras...
EUROCRYPT
2008
Springer
14 years 11 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith