Sciweavers

13383 search results - page 114 / 2677
» Abstractions from proofs
Sort
View
CORR
2011
Springer
156views Education» more  CORR 2011»
15 years 1 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
16 years 2 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
CAV
2004
Springer
126views Hardware» more  CAV 2004»
15 years 9 months ago
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
Kedar S. Namjoshi
UIC
2007
Springer
16 years 4 days ago
Towards a Model of Interaction for Mutual Aware Devices and Everyday Artifacts
Abstract. Devices like PDAs, mobile phones and Smartcards can communicate with each other and to exchange information and they should be made mutually aware of each other. For priv...
Sea Ling, Seng Wai Loke, Maria Indrawan
ICWE
2005
Springer
15 years 11 months ago
Secure Web Forms with Client-Side Signatures
Abstract. The World Wide Web is evolving from a platform for information access into a platform for interactive services. The interaction of the services is provided by forms. Some...
Mikko Honkala, Petri Vuorimaa