Sciweavers

1401 search results - page 34 / 281
» Randomness in Interactive Proofs
Sort
View
NECO
2008
62views more  NECO 2008»
15 years 1 months ago
Random Neural Networks with Synchronized Interactions
Erol Gelenbe, Stelios Timotheou
SIAMCO
2010
128views more  SIAMCO 2010»
14 years 8 months ago
A Class of Self-Interacting Processes with Applications to Games and Reinforced Random Walks
Abstract. This paper studies a class of non-Markovian and nonhomogeneous stochastic processes on a finite state space. Relying on a recent paper by Bena
Michel Benaïm, Olivier Raimond
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 3 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 3 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
ENTCS
2006
145views more  ENTCS 2006»
15 years 2 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes