233 search results - page 34 / 47 » Interactive Proofs For Quantum Computations |
101
click to vote
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
CGF
2008
14 years 11 months ago
2008
Simulating the in-water ocean light field is a daunting task. Ocean waters are one of the richest participating media, where light interacts not only with water molecules, but wit...
77
Voted
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
105
click to vote
CADE
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...