Sciweavers

1195 search results - page 65 / 239
» New constructions of SSPDs and their applications
Sort
View
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
15 years 11 months ago
RSA with Balanced Short Exponents and Its Application to Entity Authentication
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
Hung-Min Sun, Cheng-Ta Yang
IACR
2011
136views more  IACR 2011»
14 years 5 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
ANLP
1997
106views more  ANLP 1997»
15 years 7 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
ICST
2008
IEEE
16 years 18 days ago
State-Based Testing of Ajax Web Applications
Ajax supports the development of rich-client Web applications, by providing primitives for the execution of asynchronous requests and for the dynamic update of the page structure ...
Alessandro Marchetto, Paolo Tonella, Filippo Ricca
DEXAW
2006
IEEE
129views Database» more  DEXAW 2006»
16 years 7 days ago
Interaction Styles for Service Discovery in Mobile Business Applications
As the power of mobile devices continues to grow, and the range of resources accessible via wireless networks expands, there is an increasing need to offer services to users in a ...
Markus Aleksy, Colin Atkinson, Philipp Bostan, Tho...