Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,807,750 papers from all fields of science
Search
Sign In
Create Free Account
Forking lemma
The forking lemma is any of a number of related lemmas in cryptography research. The lemma states that if an adversary (typically a probabilistic…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Cryptography
Digital signature
Discrete logarithm
Eurocrypt
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Extending Blockchain Functionality with Statechain
Xiaokang Chen
,
Kunlong Zhang
International Conference on Parallel and…
2017
Corpus ID: 44187875
Blockchain has attracted great attention as the basis of cryptocurrencies such as Bitcoin, but its capabilities extend far beyond…
Expand
2016
2016
A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers
Suvradip Chakraborty
,
Srinivasan Raghuraman
,
C. Rangan
J. Wirel. Mob. Networks Ubiquitous Comput…
2016
Corpus ID: 9765829
Security of a key exchange protocol is formally established through an abstract game between a chal-lenger and an adversary. In…
Expand
2015
2015
Baking tray capable of fixedly forking hamburgers to rotate
周林斌
2015
Corpus ID: 140911232
The invention discloses a baking tray capable of fixedly forking hamburgers to rotate. A body comprises a heating element…
Expand
Review
2012
Review
2012
Neostability theory
E. Hrushovski
2012
Corpus ID: 51836457
In recent years many unexpected results have been proven using methods from model theoretic stability theory in unstable contexts…
Expand
2008
2008
Proof of Generic ID-based Ring Signature by Forking Lemma
Min Zhou
2008
Corpus ID: 124932650
Using forking lemma to prove signature scheme is an important method to prove the security of signature schemes. Pointcheval and…
Expand
2007
2007
F U N D a M E N T a Mathematicae M-rank and Meager Groups
L. Newelski
2007
Corpus ID: 48998780
Assume p∗ is a meager type in a superstable theory T . We investigate definability properties of p∗-closure. We prove that if T…
Expand
2005
2005
Forking Agents in Sensor Networks
T. Haenselmann
,
W. Effelsberg
GI Jahrestagung
2005
Corpus ID: 19200691
Information about local events are to be distributed by agents in a sensor network. The agents are sent out traveling hop-by-hop…
Expand
2005
2005
Can We Use Product-Fo rm Solution Techniques for Networks with Alternate Path R outing ?
E. Elhafsi
2005
Corpus ID: 13153316
We define a “forking node” to be a service center with one input feeding two outputs (each served by its own queue) under the…
Expand
2004
2004
DENIAL OF SERVICE ATTACKS AND SIP INFRASTRUCTURE Attack Scenarios and Prevention Mechanisms
D. Sisalem
,
J. Kuthan
,
G. Schäfer
2004
Corpus ID: 17302015
In this paper we address the issue of denial of service (DoS) attacks targeting the hardware and software of voice over IP…
Expand
2003
2003
The stable forking conjecture and generic structures
M. Pourmahdian
Archive for Mathematical Logic
2003
Corpus ID: 10172302
Abstract. We prove that for any simple theory which is constructed via Fräissé-Hrushovski method, if the forking independence is…
Expand