Sciweavers

1518 search results - page 63 / 304
» Cryptographic Test Correction
Sort
View
98
Voted
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 4 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay
95
Voted
ECCC
2007
144views more  ECCC 2007»
15 years 16 days ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
WWW
2007
ACM
16 years 1 months ago
A fault model and mutation testing of access control policies
To increase confidence in the correctness of specified policies, policy developers can conduct policy testing by supplying typical test inputs (requests) and subsequently checking...
Evan Martin, Tao Xie
85
Voted
ATAL
2009
Springer
15 years 7 months ago
Evolutionary testing of autonomous software agents
A system built in terms of autonomous agents may require even greater correctness assurance than one which is merely reacting to the immediate control of its users. Agents make su...
Cu D. Nguyen, Anna Perini, Paolo Tonella, Simon Mi...
HYBRID
2007
Springer
15 years 6 months ago
Robust Test Generation and Coverage for Hybrid Systems
Abstract. Testing is an important tool for validation of the system design and its implementation. Model-based test generation allows to systematically ascertain whether the system...
A. Agung Julius, Georgios E. Fainekos, Madhukar An...