Sciweavers

595 search results - page 68 / 119
» Languages Of Analogical Strings
Sort
View
ASIACRYPT
2000
Springer
15 years 2 months ago
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
Danny Gutfreund, Michael Ben-Or
ESOP
1999
Springer
15 years 2 months ago
Interprocedural Control Flow Analysis
Control Flow Analysis is a widely used approach for analysing functional and object oriented programs. Once the applications become more demanding also the analysis needs to be mor...
Flemming Nielson, Hanne Riis Nielson
FINTAL
2006
15 years 1 months ago
Regular Approximation of Link Grammar
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
POPL
2000
ACM
15 years 1 months ago
Verifying Secrets and Relative Secrecy
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
Dennis M. Volpano, Geoffrey Smith
FCS
2006
14 years 11 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith