Sciweavers

147
Voted
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 9 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
152
Voted
CNSR
2007
IEEE
181views Communications» more  CNSR 2007»
15 years 9 months ago
The Application of Users' Collective Experience for Crafting Suitable Search Engine Query Recommendations
Search engines have turned into one of the most important services of the Web that are frequently visited by any user. They assist their users in finding appropriate information. ...
Faezeh Ensan, Ebrahim Bagheri, Mohsen Kahani
123
Voted
PKC
2010
Springer
146views Cryptology» more  PKC 2010»
15 years 9 months ago
Groth-Sahai Proofs Revisited
Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi
173
Voted
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
15 years 9 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa