Sciweavers

1763 search results - page 155 / 353
» Dependent random choice
Sort
View
TCC
2007
Springer
91views Cryptology» more  TCC 2007»
14 years 2 months ago
Lower Bounds for Non-interactive Zero-Knowledge
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
Hoeteck Wee
CIBCB
2006
IEEE
14 years 2 months ago
A Stochastic model to estimate the time taken for Protein-Ligand Docking
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
INFOCOM
2006
IEEE
14 years 2 months ago
Impact of Mobility on the Performance of Relaying in Ad Hoc Networks
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...
WIOPT
2006
IEEE
14 years 2 months ago
Capacity optimizing hop distance in a mobile ad hoc network with power control
Abstract— In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a c...
Dinesh Kumar 0002, Venkatesh Ramaiyan, Anurag Kuma...
ESORICS
2005
Springer
14 years 1 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento