Sciweavers

28 search results - page 2 / 6
» Fast Garbling of Circuits Under Standard Assumptions
Sort
View
EUROCRYPT
2004
Springer
13 years 11 months ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
VTS
2006
IEEE
108views Hardware» more  VTS 2006»
14 years 13 days ago
Bridging the Accuracy of Functional and Machine-Learning-Based Mixed-Signal Testing
Abstract— Numerous machine-learning-based test methodologies have been proposed in recent years as a fast alternative to the standard functional testing of mixed-signal/RF integr...
Haralampos-G. D. Stratigopoulos, Yiorgos Makris
INDOCRYPT
2004
Springer
13 years 11 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...
ICCAD
2005
IEEE
125views Hardware» more  ICCAD 2005»
14 years 3 months ago
Robust mixed-size placement under tight white-space constraints
A novel and very simple correct-by-construction top-down methodology for high-utilization mixed-size placement is presented. The PolarBear algorithm combines recursive cutsize-dri...
Jason Cong, Michail Romesis, Joseph R. Shinnerl
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
14 years 1 days ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan