1401 search results - page 55 / 281 » Randomness in Interactive Proofs |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
We study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modul...
CASSIS
2005
Springer
15 years 3 months ago
2005
Springer
This paper introduces notions of resource policy for mobile code to be run on smart devices, to integrate with the proof-carrying code architecture of the Mobile Resource Guarantee...
101
click to vote
ASIACRYPT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
106
click to vote
STOC
1998
ACM
15 years 2 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...