1401 search results - page 10 / 281 » Randomness in Interactive Proofs |
130
Voted
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
164
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
150
Voted
CRYPTO
2012
Springer
13 years 6 months ago
2012
Springer
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
128
Voted
CASSIS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
134
click to vote
JAR
2008
15 years 3 months ago
2008
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...