Sciweavers

3228 search results - page 556 / 646
» Computationally Sound Proofs
Sort
View
CSL
1999
Springer
14 years 1 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
EUROCRYPT
1999
Springer
14 years 1 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
ICCAD
1998
IEEE
153views Hardware» more  ICCAD 1998»
14 years 1 months ago
Intellectual property protection by watermarking combinational logic synthesis solutions
The intellectual property (IP) business model is vulnerable to a number of potentially devastating obstructions, such as misappropriation and intellectual property fraud. We propo...
Darko Kirovski, Yean-Yow Hwang, Miodrag Potkonjak,...
ICMCS
1997
IEEE
142views Multimedia» more  ICMCS 1997»
14 years 1 months ago
A Rate Allocation Policy with MCR/PCR Support and Distributed ABR Implementation Using Explicit Rate Feedback
An important concept in the available bit rate (ABR) service model as defined by the ATM Forum is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constra...
Yiwei Thomas Hou, Henry H.-Y. Tzeng, Shivendra S. ...
COCO
1997
Springer
127views Algorithms» more  COCO 1997»
14 years 29 days ago
A Nonadaptive NC Checker for Permutation Group Intersection
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
Vikraman Arvind, Jacobo Torán