612 search results - page 49 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2000
IEEE
14 years 8 days ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
SCCC
1998
IEEE
14 years 3 days ago
1998
IEEE
Frameworks promote design and code reuse, at a higher level of granularity. The use of frameworks is a hard task though, because usually they lack documentation and instructions o...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
Graph transformations are one of the best known approaches for defining transformations in model-based software development. They are defined over the abstract syntax of source and...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
EJC
2008
13 years 8 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...