Sciweavers

608 search results - page 18 / 122
» Interactive Oracle Proofs
Sort
View
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
FOCS
1999
IEEE
14 years 2 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
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...
Amit Sahai
CHI
2004
ACM
14 years 10 months ago
24/7 or bust: designing for the challenges of global UCD
The globalization of Oracle's development organization, customer base, and product lines has had an ongoing impact on the evolution of the Oracle UI Group (OUI). It has chang...
Dan Rosenberg, Uday Gajendar
CASSIS
2005
Springer
14 years 3 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
JAR
2008
95views more  JAR 2008»
13 years 9 months ago
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
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...
Marc Bezem, Dimitri Hendriks