Sciweavers

915 search results - page 44 / 183
» Proof labeling schemes
Sort
View
ASIACRYPT
2000
Springer
14 years 8 days ago
Commital Deniable Proofs and Electronic Campaign Finance
In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the “market” for monetary influence in political campaigns. ...
Matthew K. Franklin, Tomas Sander
ASIACRYPT
2009
Springer
13 years 12 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
14 years 4 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
ISCAS
2008
IEEE
107views Hardware» more  ISCAS 2008»
14 years 2 months ago
A passive filter aided timing recovery scheme
— This paper presents a passive filter for the front end of a high speed serial link receiver to aid timing recovery. The filter provides simultaneous lowpass and highpass tran...
Faisal A. Musa, Anthony Chan Carusone
IEICET
2006
108views more  IEICET 2006»
13 years 8 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki