Sciweavers

1818 search results - page 229 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
ASIACRYPT
2010
Springer
15 years 2 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
CASES
2010
ACM
15 years 2 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
FSTTCS
2010
Springer
15 years 2 months ago
Lower bounds for Quantum Oblivious Transfer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
André Chailloux, Iordanis Kerenidis, Jamie ...
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
15 years 1 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
Tao Huang, Evangeline F. Y. Young
IMCSIT
2010
15 years 1 months ago
BeesyBees - Efficient and Reliable Execution of Service-based Workflow Applications for BeesyCluster using Distributed Agents
Abstract--The paper presents an architecture and implementation that allows distributed execution of workflow applications in BeesyCluster using agents. BeesyCluster is a middlewar...
Pawel Czarnul, Mariusz R. Matuszek, Michal W&oacut...