Sciweavers

608 search results - page 49 / 122
» Interactive Oracle Proofs
Sort
View
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 7 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
EUROCRYPT
2009
Springer
14 years 10 months ago
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of "circular encryption," by presenting a public key encrypti...
Jan Camenisch, Nishanth Chandran, Victor Shoup
CIE
2007
Springer
14 years 4 months ago
Speed-Up Theorems in Type-2 Computation
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
Chung-Chih Li
ACNS
2004
Springer
133views Cryptology» more  ACNS 2004»
14 years 1 months ago
Limited Verifier Signature from Bilinear Pairings
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
EUROCRYPT
2000
Springer
14 years 1 months ago
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
Victor Shoup