Sciweavers

36 search results - page 6 / 8
» Statistically-hiding commitment from any one-way function
Sort
View
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 8 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
SSS
2009
Springer
195views Control Systems» more  SSS 2009»
14 years 2 months ago
Anonymous Transactions in Computer Networks
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
Shlomi Dolev, Marina Kopeetsky
KDD
2002
ACM
93views Data Mining» more  KDD 2002»
14 years 7 months ago
Interactive deduplication using active learning
Deduplication is a key operation in integrating data from multiple sources. The main challenge in this task is designing a function that can resolve when a pair of records refer t...
Sunita Sarawagi, Anuradha Bhamidipaty