Sciweavers

2432 search results - page 252 / 487
» Cryptographic logical relations
Sort
View
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 7 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
EDBT
2004
ACM
108views Database» more  EDBT 2004»
16 years 6 months ago
A Framework for Efficient Storage Security in RDBMS
Abstract. With the widespread use of e-business coupled with the public's awareness of data privacy issues and recent database security related legislations, incorporating sec...
Balakrishna R. Iyer, Sharad Mehrotra, Einar Myklet...
DCC
2007
IEEE
16 years 6 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas
ICS
2010
Tsinghua U.
16 years 4 months ago
Game Theory with Costly Computation: Formulation and Application to Protocol Security
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
Joseph Y. Halpern, Rafael Pass
ICCD
2007
IEEE
140views Hardware» more  ICCD 2007»
16 years 3 months ago
A low overhead hardware technique for software integrity and confidentiality
Software integrity and confidentiality play a central role in making embedded computer systems resilient to various malicious actions, such as software attacks; probing and tamper...
Austin Rogers, Milena Milenkovic, Aleksandar Milen...