20175 search results - page 10 / 4035 » Is abstraction the key to computing |
114
Voted
ICCSA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Due to an increasing number of portable devices over 785million world Internet users, a support for quality of service (QoS) and security becomes a significant issue in ...
119
Voted
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
15 years 9 days ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
155
click to vote
EUROCRYPT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
123
click to vote
ACNS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...